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 10:39Victor MerckléVictor MerckléScore: 5,489Success
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 10:425,40012,350,2644,752,00002,113,536
2Jun 23, 2026 10:425,47712,326,6354,820,00002,113,536
3Jun 23, 2026 10:425,48012,268,6784,823,00002,113,536
4Jun 23, 2026 10:425,48412,256,3854,826,00002,113,536
5Jun 23, 2026 10:425,48919,019,3254,831,00002,113,536
6Jun 23, 2026 10:425,49712,636,5494,838,00002,113,536
7Jun 23, 2026 10:425,50312,335,7824,843,00002,113,536
8Jun 23, 2026 10:425,55112,434,5284,885,00002,113,536
9Jun 23, 2026 10:425,68412,497,2465,002,00002,113,536