News for hackers. Stuff that matters.
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by mikeash on Sunday October 21, 2012 @01:29PM (#4680172)
Since code size is not restricted, the obvious solution is to store the entire list of numbers received in the program counter. In short, put every possible input combination into the code, and just follow whatever branch pattern you receive.

This requires no memory other than that for the networking stack. It is, of course, also completely impractical.

Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by curiousdannii on Monday October 22, 2012 @12:56AM (#4681908)
This was my thought as well. But if you can afford several TB of ROM you can probably afford to increase your RAM to 4MB.
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by emn13 on Monday October 22, 2012 @06:59AM (#4682580)
it's not TB of ROM. It' much, much more: 2^(2^20) addresses... Even if you're faking it and the addresses aren't real (inevitable with those numbers), you're still just cheating and storing data in a multi-megabyte dynamic (not ROM!) program counter. After all, you need to distinguish all those addresses...
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by mikeash on Monday October 22, 2012 @09:13AM (#4682949)
It's not cheating! If they wanted to limit the size of the program counter then they should have specified a limit on the amount of code!