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 21, 2026 19:26M-RochatM-RochatScore: 25,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:2825,82634,583,93321,641,0001,086,0002,113,536
2May 21, 2026 19:2825,83833,417,50921,667,0001,071,0002,113,536
3May 21, 2026 19:2825,90734,118,99221,721,0001,078,0002,113,536
4May 21, 2026 19:2825,91132,607,14221,747,0001,055,0002,113,536
5May 21, 2026 19:2825,91142,780,81721,694,0001,108,0002,113,536
6May 21, 2026 19:2825,91532,379,10121,635,0001,171,0002,113,536
7May 21, 2026 19:2825,98634,842,91021,826,0001,042,0002,113,536
8May 21, 2026 19:2825,99534,669,10821,827,0001,049,0002,113,536
9May 21, 2026 19:2826,03633,498,54821,738,0001,174,0002,113,536