Split the file into k chunks of size n. Sort them in time k(n log n). Then you can merge them in log k layers in a binary tree sort of structure, taking time kn for each layer. Total time will be k(n log n) + kn(log k) = kn (log n + log k) = kn(log kn).

Use mergesort.