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 12:25Victor MerckléVictor MerckléScore: 5,286Success
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 12:285,25512,234,9374,625,00002,113,536
2Jun 23, 2026 12:285,27012,131,0024,638,00002,113,536
3Jun 23, 2026 12:285,27312,190,4644,641,00002,113,536
4Jun 23, 2026 12:285,27612,117,9934,643,00002,113,536
5Jun 23, 2026 12:285,28612,142,4794,652,00002,113,536
6Jun 23, 2026 12:285,29812,472,2704,663,00002,113,536
7Jun 23, 2026 12:285,39012,221,3274,744,00002,113,536
8Jun 23, 2026 12:285,50612,627,9344,846,00002,113,536
9Jun 23, 2026 12:285,67312,757,3614,993,00002,113,536