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 02:46Victor MerckléVictor MerckléScore: 6,418Success
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 02:496,32013,049,4715,562,00002,113,536
2Jun 23, 2026 02:496,32113,499,6315,563,00002,113,536
3Jun 23, 2026 02:496,33413,091,3265,574,00002,113,536
4Jun 23, 2026 02:496,33813,100,2225,578,00002,113,536
5Jun 23, 2026 02:496,41813,206,1925,648,00002,113,536
6Jun 23, 2026 02:496,45613,483,8135,682,00002,113,536
7Jun 23, 2026 02:496,46713,513,2875,691,00002,113,536
8Jun 23, 2026 02:496,48413,496,8025,706,00002,113,536
9Jun 23, 2026 02:496,61413,324,7175,821,00002,113,536