Sorting Gigabytes of Strings Without Storing Them

neversaint has asked for the wisdom of the Perl Monks concerning the following question:

Dear Masters,
I have a set of strings with upto 2GB lines.
Is there an memory efficient way to sort these strings?

# Strings below up to > 2GB lines
__DATA__
AAACGAGAAGTAATATCAGTATCGTATGCTTCAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
TTTTCGCCTTCCGGGTGCCGCTGGGGTCTTTCTC
GCACACTCGGAGCCCGGGGAGCCAGAGGAAACAA
GATCATGACACAGTTGATAAAATTGTTGTTCAGA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACC
AAACGAGAAGTAATATCAGTATCGTATGCTTCAC
AAACGAGAAGTAATATCAGTATCGTATGCTTCGA
AAACGAGAAGTAATATCAGTATCGTATGTTTCAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATA
[download]

I can always stored them in array then apply the standard sort function. But I have memory problem with that classical approach.

---
neversaint and everlastingly indebted.......

Back to Seekers of Perl Wisdom