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 6, 2026 07:38Victor MerckléVictor MerckléScore: 8,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 07:408,84815,220,5787,787,00002,113,536
2Jun 6, 2026 07:408,86015,403,5117,797,00002,113,536
3Jun 6, 2026 07:408,90015,292,5307,832,00002,113,536
4Jun 6, 2026 07:408,90615,077,2427,838,00002,113,536
5Jun 6, 2026 07:408,91715,229,9437,847,00002,113,536
6Jun 6, 2026 07:408,93615,253,5647,864,00002,113,536
7Jun 6, 2026 07:408,95915,194,3627,884,00002,113,536
8Jun 6, 2026 07:408,96015,615,4027,885,00002,113,536
9Jun 6, 2026 07:409,07715,388,8207,988,00002,113,536