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 5, 2026 11:38Victor MerckléVictor MerckléScore: 9,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 11:419,88416,206,9888,698,00002,113,536
2Jun 5, 2026 11:419,91216,241,3768,723,00002,113,536
3Jun 5, 2026 11:419,96216,193,4588,767,00002,113,536
4Jun 5, 2026 11:419,96516,266,6938,770,00002,113,536
5Jun 5, 2026 11:419,98416,539,7538,786,00002,113,536
6Jun 5, 2026 11:419,98916,227,3268,791,00002,113,536
7Jun 5, 2026 11:419,98916,247,9988,791,00002,113,536
8Jun 5, 2026 11:419,99316,236,1358,794,00002,113,536
9Jun 5, 2026 11:4110,00516,272,3848,805,00002,113,536