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 13:36Josu San MartinJosu San MartinScore: 6,615Success
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 13:386,50513,339,4165,725,00002,113,536
2Jun 22, 2026 13:386,55113,353,9655,765,00002,113,536
3Jun 22, 2026 13:386,57313,412,8235,785,00002,113,536
4Jun 22, 2026 13:386,60013,327,0105,808,00002,113,536
5Jun 22, 2026 13:386,61513,314,9625,822,00002,113,536
6Jun 22, 2026 13:386,65913,451,2775,860,00002,113,536
7Jun 22, 2026 13:386,79013,524,0005,976,00002,113,536
8Jun 22, 2026 13:386,91213,850,4276,083,00002,113,536
9Jun 22, 2026 13:386,94422,640,9835,012,0001,099,0002,113,536