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 04:41Victor MerckléVictor MerckléScore: 7,405Success
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 04:467,33413,988,7296,454,00002,113,536
2Jun 23, 2026 04:467,35413,997,1846,472,00002,113,536
3Jun 23, 2026 04:467,35914,022,1866,476,00002,113,536
4Jun 23, 2026 04:467,40213,926,2276,514,00002,113,536
5Jun 23, 2026 04:467,40514,928,2236,517,00002,113,536
6Jun 23, 2026 04:467,42814,301,7466,537,00002,113,536
7Jun 23, 2026 04:467,44614,032,8176,553,00002,113,536
8Jun 23, 2026 04:467,51314,413,4266,612,00002,113,536
9Jun 23, 2026 04:467,53214,036,2906,629,00002,113,536