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 23, 2026 08:56Victor MerckléVictor MerckléScore: 5,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 08:595,71212,559,0565,027,00002,113,536
2Jun 23, 2026 08:595,72312,525,0515,037,00002,113,536
3Jun 23, 2026 08:595,81212,582,3905,115,00002,113,536
4Jun 23, 2026 08:595,81812,533,5085,120,00002,113,536
5Jun 23, 2026 08:595,82613,008,0115,127,00002,113,536
6Jun 23, 2026 08:595,83812,573,2065,138,00002,113,536
7Jun 23, 2026 08:595,86912,760,1385,165,00002,113,536
8Jun 23, 2026 08:596,06312,817,6585,336,00002,113,536
9Jun 23, 2026 08:596,06312,815,2105,336,00002,113,536