We describe new implementations of MSD radix sort for efficiently sorting large collections of strings. Our implementations
are significantly faster than previous MSD radix sort implementations, and in fact faster than any other string sorting algorithm
on several data sets. We also describe a new variant that achieves high space-efficiency at a small additional cost on runtime.
Supported in part by Academy of Finland grant 118653 (ALGODAN).