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 listJun 5, 2026 12:47Victor MerckléVictor MerckléScore: 9,545Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 12:509,47315,866,2458,337,00002,113,536
2Jun 5, 2026 12:509,49615,852,9308,357,00002,113,536
3Jun 5, 2026 12:509,51715,883,5608,375,00002,113,536
4Jun 5, 2026 12:509,52015,853,2138,378,00002,113,536
5Jun 5, 2026 12:509,54515,902,5468,400,00002,113,536
6Jun 5, 2026 12:509,57915,925,0918,430,00002,113,536
7Jun 5, 2026 12:509,60615,906,1218,454,00002,113,536
8Jun 5, 2026 12:509,61515,954,4448,462,00002,113,536
9Jun 5, 2026 12:509,65315,979,9608,495,00002,113,536