Questions tagged [restricted-memory]

For challenges with a restriction placed on the amount of memory that can be allocated. This can be through direct limits (e.g. 64 bytes) or through big-O-notation (e.g. O(n log(n))).

Filter by
Sorted by
Tagged with
4
votes
3answers
264 views

Fastest unique finder

Given 4096 16-bit integers, only four of which are unique and others appeared twice (so 2050 different integers exist). Find the four uniques. To time precisely and limit RAM usage, your program will ...
4
votes
3answers
259 views

unRSA: solve the private key

Given positive integer n and e, knowing that e<n and that ...
13
votes
1answer
227 views

Efficiently generate all vector partitions

A vector partition is splitting a vector up a series of vectors such that their sum is the original. Here are a couple partitions: ...
78
votes
191answers
14k views

Count up forever

Write a program that counts up forever, starting from one. Rules: Your program must log to STDOUT or an acceptable alternative, if ...
3
votes
13answers
790 views

Finding duplicate balls in a basket? [closed]

A basket is full with \$n\$ colored balls. For each color except one, there are at least 2 balls with that color. Find the color which only has one ball. in \$O(n)\$ space complexity. What if each ...
40
votes
9answers
6k views

Text compression and decompression — “Nevermore.”

With the recent discussion about the use of compression tools in code golf, I thought it would be a nice challenge to write your own text compressor and decompressor. Challenge: Write two programs: ...