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 21, 2026 14:16Victor MerckléVictor MerckléScore: 6,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 14:196,68713,364,9685,885,00002,113,536
2Jun 21, 2026 14:196,69213,474,7825,889,00002,113,536
3Jun 21, 2026 14:196,73213,434,1825,925,00002,113,536
4Jun 21, 2026 14:196,79213,397,9845,977,00002,113,536
5Jun 21, 2026 14:196,79613,466,0285,981,00002,113,536
6Jun 21, 2026 14:196,80513,399,3635,989,00002,113,536
7Jun 21, 2026 14:196,80613,695,2035,990,00002,113,536
8Jun 21, 2026 14:196,82814,983,8176,009,00002,113,536
9Jun 21, 2026 14:196,83114,769,6566,012,00002,113,536