Memory equivalent of the 1-minute rule ?

[stijn263]

What's the memory equivalent of the "one-minute rule"?

Is this taken into account when designing a problem ? (like Problem 161 (View Problem))

[hk]

Problem 161 is not the most memory intensive as far as I know.
There isn't a memory equivalent of the 1 minute rule.
We pay attention to the memory requirements of our optimal solution. (maximally about 200-250 MB).
Memory gobbling other solutions we do not take into account. That's part of the game.
I could solve all problems up till now with less than 250MB. (Actually that is the amount that I can use without trouble).

[LarryC]

What language is that that requires at most 250MB of memory? I know many languages (such as Java and Python) can consume far more memory for the same data stored than others - what maximum bound can be expect for these languages?

[hk]

That does not depend on the language but on the amount of memory your computer has. Mine does not have so much memory....However one gets very creative in such circumstances.

[quilan]

Some ones I had issues with memory on:

Problem 155 (View Problem) - Reaaaallly pressed against the limit here, although if I were to re-do it, I'd somehow use sets instead of dictionaries.
Problem 211 (View Problem) - If I were to attempt it in Python, I'd have to do some creative partitioning of my algorithm to keep it in workable memory size (or invest in some other python package that works well with arrays).
Problem 216 (View Problem) - Same as above.

Actually, there were a few problems of array size > ~N0,000,000 that I had issues with in Python. Some day I'll get around to downloading a module for efficient array manipulations. Although on Windows 32-bit, I think applications are limited to ~2 GB of RAM? Or am I remembering that incorrectly?