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 14:36Victor MerckléVictor MerckléScore: 6,892Success
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 14:396,77513,459,0035,962,00002,113,536
2Jun 21, 2026 14:396,77813,473,2695,965,00002,113,536
3Jun 21, 2026 14:396,81713,495,4355,999,00002,113,536
4Jun 21, 2026 14:396,88013,572,7466,055,00002,113,536
5Jun 21, 2026 14:396,89213,485,9366,065,00002,113,536
6Jun 21, 2026 14:396,89813,544,7196,071,00002,113,536
7Jun 21, 2026 14:396,91513,602,0796,086,00002,113,536
8Jun 21, 2026 14:397,00213,608,1856,162,00002,113,536
9Jun 21, 2026 14:397,00413,610,5456,164,00002,113,536