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 07:50Victor MerckléVictor MerckléScore: 5,852Success
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 07:535,72112,542,8845,035,00002,113,536
2Jun 23, 2026 07:535,74612,581,9485,057,00002,113,536
3Jun 23, 2026 07:535,83512,660,1215,135,00002,113,536
4Jun 23, 2026 07:535,83712,631,3275,137,00002,113,536
5Jun 23, 2026 07:535,85212,955,1235,150,00002,113,536
6Jun 23, 2026 07:535,85612,630,5655,154,00002,113,536
7Jun 23, 2026 07:535,86012,863,2315,157,00002,113,536
8Jun 23, 2026 07:535,89412,693,7465,187,00002,113,536
9Jun 23, 2026 07:535,97113,047,1865,255,00002,113,536