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 12:56Josu San MartinJosu San MartinScore: 6,610Success
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 12:596,45513,321,1545,681,00002,113,536
2Jun 22, 2026 12:596,58213,653,8995,793,00002,113,536
3Jun 22, 2026 12:596,58713,375,6715,797,00002,113,536
4Jun 22, 2026 12:596,59613,344,2544,804,0001,001,0002,113,536
5Jun 22, 2026 12:596,61013,426,1585,817,00002,113,536
6Jun 22, 2026 12:596,61913,337,6155,825,00002,113,536
7Jun 22, 2026 12:596,63013,285,6315,835,00002,113,536
8Jun 22, 2026 12:596,64513,433,6285,848,00002,113,536
9Jun 22, 2026 12:596,85513,603,5296,033,00002,113,536