Re^2: Is it possible to make reference to substrings and sort them?

Excellent, it took:

Spent 398.221 wallclock secs (397.00 usr + 0.98 sys = 397.98 CPU)

for a sequence of 4639675 nt

I just thought about not using the complete length of text in sort, like using only the first 1000 nt, but your idea is accurate.

Comment on Re^2: Is it possible to make reference to substrings and sort them? Download Code