Does there exist a Turing-machine that runs in time $o(n\log n)$, but not $O(n)$?
The answer seems to be negative, according to Corollary 4.12 of Verifying Time Complexity of Deterministic Turing Machines by David Gajser (ArXiv).