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 22, 2026 17:10Josu San MartinJosu San MartinScore: 5,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 17:135,54312,422,6174,878,00002,113,536
2Jun 22, 2026 17:135,62512,397,2664,950,00002,113,536
3Jun 22, 2026 17:135,64412,619,1374,967,00002,113,536
4Jun 22, 2026 17:135,65612,403,2124,978,00002,113,536
5Jun 22, 2026 17:135,66312,417,3104,984,00002,113,536
6Jun 22, 2026 17:135,66812,829,5554,988,00002,113,536
7Jun 22, 2026 17:135,67012,469,1724,990,00002,113,536
8Jun 22, 2026 17:135,68012,779,2444,999,00002,113,536
9Jun 22, 2026 17:135,69813,785,3955,015,00002,113,536