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 20:41M-RochatM-RochatScore: 40,365Success
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 20:4540,19644,354,27035,373,00002,113,536
2May 16, 2026 20:4540,26743,985,32335,435,00002,113,536
3May 16, 2026 20:4540,29644,048,05435,461,00002,113,536
4May 16, 2026 20:4540,31944,011,28735,481,00002,113,536
5May 16, 2026 20:4540,36545,856,86935,522,00002,113,536
6May 16, 2026 20:4540,37544,773,61435,530,00002,113,536
7May 16, 2026 20:4540,41444,136,44535,565,00002,113,536
8May 16, 2026 20:4540,43644,162,92535,584,00002,113,536
9May 16, 2026 20:4540,50746,182,10135,647,00002,113,536