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 21:50M-RochatM-RochatScore: 27,698Success
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 21:5427,57537,069,02923,154,0001,112,0002,113,536
2May 16, 2026 21:5427,57935,673,99223,166,0001,104,0002,113,536
3May 16, 2026 21:5427,61433,843,03223,165,0001,136,0002,113,536
4May 16, 2026 21:5427,68034,591,63823,333,0001,026,0002,113,536
5May 16, 2026 21:5427,69835,711,05523,237,0001,138,0002,113,536
6May 16, 2026 21:5427,71733,505,18723,267,0001,124,0002,113,536
7May 16, 2026 21:5427,73833,262,25323,295,0001,115,0002,113,536
8May 16, 2026 21:5427,78233,521,96623,326,0001,123,0002,113,536
9May 16, 2026 21:5427,95048,675,28223,535,0001,061,0002,117,632