Merge sort is the best known algorithm to sort a linked list in $Θ(nlogn)$ time, and this is even in-place sorting unlike array sorting by merge sort which is not in-place.
There are logn elements in the linked list, hence the overall T.C will be $Θ(logn*loglogn)$.