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:31M-RochatM-RochatScore: 24,122Success
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:3323,94031,276,61520,002,0001,066,0002,113,536
2May 21, 2026 19:3323,97230,433,35620,045,0001,051,0002,113,536
3May 21, 2026 19:3324,04531,825,18620,088,0001,072,0002,113,536
4May 21, 2026 19:3324,09333,221,17520,176,0001,026,0002,113,536
5May 21, 2026 19:3324,12231,509,13420,201,0001,027,0002,113,536
6May 21, 2026 19:3324,14230,876,50320,096,0001,149,0002,113,536
7May 21, 2026 19:3324,22632,403,25920,294,0001,025,0002,113,536
8May 21, 2026 19:3324,24330,991,20820,306,0001,028,0002,113,536
9May 21, 2026 19:3324,30431,263,14220,346,0001,042,0002,113,536