Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

Back to listMay 16, 2026 20:42M-RochatM-RochatScore: 47,837Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 20:4847,63250,429,42141,917,00002,113,536
2May 16, 2026 20:4847,72950,671,54342,002,00002,113,536
3May 16, 2026 20:4847,73050,573,29642,003,00002,113,536
4May 16, 2026 20:4847,75650,605,22842,026,00002,113,536
5May 16, 2026 20:4847,83751,962,01742,097,00002,113,536
6May 16, 2026 20:4847,86050,519,87842,117,00002,113,536
7May 16, 2026 20:4847,90751,699,58842,159,00002,113,536
8May 16, 2026 20:4847,96252,535,53142,207,00002,113,536
9May 16, 2026 20:4847,97750,686,41842,220,00002,113,536