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:35M-RochatM-RochatScore: 23,662Success
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:3823,55530,997,93219,671,0001,058,0002,113,536
2May 21, 2026 19:3823,58131,886,32119,691,0001,061,0002,113,536
3May 21, 2026 19:3823,62230,428,14319,719,0001,069,0002,113,536
4May 21, 2026 19:3823,64432,398,70719,748,0001,059,0002,113,536
5May 21, 2026 19:3823,66230,126,66019,762,0001,061,0002,113,536
6May 21, 2026 19:3823,67731,092,61719,756,0001,080,0002,113,536
7May 21, 2026 19:3823,70130,643,49419,822,0001,035,0002,113,536
8May 21, 2026 19:3823,76731,316,19019,890,0001,025,0002,113,536
9May 21, 2026 19:3823,83430,332,33919,947,0001,027,0002,113,536