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 11:45Josu San MartinJosu San MartinScore: 6,969Success
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 11:476,70413,563,5385,900,00002,113,536
2Jun 22, 2026 11:476,73513,465,9565,927,00002,113,536
3Jun 22, 2026 11:476,73613,504,6695,928,00002,113,536
4Jun 22, 2026 11:476,80513,485,0315,989,00002,113,536
5Jun 22, 2026 11:476,96913,649,0256,133,00002,113,536
6Jun 22, 2026 11:476,97914,935,8466,142,00002,113,536
7Jun 22, 2026 11:476,99013,609,5596,152,00002,113,536
8Jun 22, 2026 11:477,06813,754,3576,220,00002,113,536
9Jun 22, 2026 11:477,09014,044,5046,240,00002,113,536