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 21, 2026 13:06Victor MerckléVictor MerckléScore: 6,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 13:096,70613,436,5625,902,00002,113,536
2Jun 21, 2026 13:096,72313,420,4815,917,00002,113,536
3Jun 21, 2026 13:096,80013,450,3405,984,00002,113,536
4Jun 21, 2026 13:096,81313,501,1655,996,00002,113,536
5Jun 21, 2026 13:096,81513,640,5335,998,00002,113,536
6Jun 21, 2026 13:096,81713,441,7335,999,00002,113,536
7Jun 21, 2026 13:096,81813,423,2896,000,00002,113,536
8Jun 21, 2026 13:096,83013,445,3516,011,00002,113,536
9Jun 21, 2026 13:096,94713,580,9746,114,00002,113,536