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 18:40M-RochatM-RochatScore: 22,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 22, 2026 18:4222,61229,171,67818,832,0001,067,0002,113,536
2May 22, 2026 18:4222,61429,629,41518,842,0001,059,0002,113,536
3May 22, 2026 18:4222,63631,045,68018,853,0001,067,0002,113,536
4May 22, 2026 18:4222,66830,957,20418,883,0001,065,0002,113,536
5May 22, 2026 18:4222,69830,474,04918,909,0001,066,0002,113,536
6May 22, 2026 18:4222,69830,322,80518,907,0001,068,0002,113,536
7May 22, 2026 18:4222,71530,421,91518,928,0001,062,0002,113,536
8May 22, 2026 18:4222,76032,079,28819,002,0001,027,0002,113,536
9May 22, 2026 18:4222,76832,716,68419,010,0001,026,0002,113,536