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 22, 2026 17:24M-RochatM-RochatScore: 23,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 17:2723,30930,034,11119,471,0001,041,0002,113,536
2May 22, 2026 17:2723,44830,887,71119,585,0001,050,0002,113,536
3May 22, 2026 17:2723,47032,983,67219,538,0001,116,0002,113,536
4May 22, 2026 17:2723,47132,347,32519,599,0001,056,0002,113,536
5May 22, 2026 17:2723,50331,946,58319,545,0001,138,0002,113,536
6May 22, 2026 17:2723,53630,627,80319,685,0001,027,0002,113,536
7May 22, 2026 17:2723,58130,356,73019,622,0001,130,0002,113,536
8May 22, 2026 17:2723,58437,401,31719,622,0001,132,0002,113,536
9May 22, 2026 17:2723,76135,712,48919,850,0001,060,0002,117,632