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 20:13Victor MerckléVictor MerckléScore: 5,221Success
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 20:165,08511,978,4374,475,00002,113,536
2Jun 23, 2026 20:165,12112,017,0794,507,00002,113,536
3Jun 23, 2026 20:165,20212,372,7554,578,00002,113,536
4Jun 23, 2026 20:165,21412,051,3344,589,00002,113,536
5Jun 23, 2026 20:165,22112,403,2294,595,00002,113,536
6Jun 23, 2026 20:165,22312,053,9324,597,00002,113,536
7Jun 23, 2026 20:165,25512,131,2884,625,00002,113,536
8Jun 23, 2026 20:165,27112,028,5944,639,00002,113,536
9Jun 23, 2026 20:165,30012,465,8584,664,00002,113,536