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 09:22Victor MerckléVictor MerckléScore: 5,802Success
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 09:245,69012,537,1855,008,00002,113,536
2Jun 23, 2026 09:245,71812,600,1895,032,00002,113,536
3Jun 23, 2026 09:245,79812,557,6955,103,00002,113,536
4Jun 23, 2026 09:245,80112,708,5915,105,00002,113,536
5Jun 23, 2026 09:245,80212,704,5405,106,00002,113,536
6Jun 23, 2026 09:245,82312,983,0795,125,00002,113,536
7Jun 23, 2026 09:245,83912,605,1165,139,00002,113,536
8Jun 23, 2026 09:245,84612,532,7525,145,00002,113,536
9Jun 23, 2026 09:245,90213,032,3345,194,00002,113,536