Another possibility beyond choroba's suggestion would be using a database. For large data structures, a database will often win out. Assuming you are committed to doing it all in memory, you could use DBD::SQLite in an in-memory context to avoid disk access issues.
#11929 First ask yourself `How would I do this without a computer?' Then have the computer do it the same way.
In reply to Re: What is the most memory efficient way to (sort) and print a hash?
by kennethk
in thread What is the most memory efficient way to (sort) and print a hash?
by a_salway
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |