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 19, 2026 22:31Victor MerckléVictor MerckléScore: 6,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 22:336,85413,572,5886,032,00002,113,536
2Jun 19, 2026 22:336,90613,514,5426,078,00002,113,536
3Jun 19, 2026 22:336,92013,595,0016,090,00002,113,536
4Jun 19, 2026 22:336,96013,814,6196,125,00002,113,536
5Jun 19, 2026 22:336,96813,888,1506,132,00002,113,536
6Jun 19, 2026 22:336,97813,852,0556,141,00002,113,536
7Jun 19, 2026 22:336,98713,582,4496,149,00002,113,536
8Jun 19, 2026 22:337,03413,606,2926,190,00002,113,536
9Jun 19, 2026 22:337,11513,717,1816,262,00002,113,536