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 15:01Josu San MartinJosu San MartinScore: 6,078Success
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 15:045,94612,787,6565,233,00002,113,536
2Jun 22, 2026 15:045,97012,777,6905,254,00002,113,536
3Jun 22, 2026 15:046,05712,827,6355,331,00002,113,536
4Jun 22, 2026 15:046,06812,885,2065,340,00002,113,536
5Jun 22, 2026 15:046,07813,206,0935,349,00002,113,536
6Jun 22, 2026 15:046,09512,898,2275,364,00002,113,536
7Jun 22, 2026 15:046,09612,905,4075,365,00002,113,536
8Jun 22, 2026 15:046,10012,868,0115,368,00002,113,536
9Jun 22, 2026 15:046,11413,183,1025,381,00002,113,536