in reply to Re^4: Tallying co-occurence of numbers
in thread Tallying co-occurence of numbers

You could try packing your numbers into a 64-bit int; it might save some space:

 ++$hash{ pack 'Q', $n_1to20 * 1.2e6**2 + $a_1to1_2e6 * 1.2e6 + $b_1to
+1_2e6 };

[download]

It depends on the mix of sizes of the larger numbers. (I'll think on it some more.)

Also, try pre-extending your hash to 3 million: keys %hash = 3e6;

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)
In the absence of evidence, opinion is indistinguishable from prejudice. Not understood.

In Section Seekers of Perl Wisdom