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 listApr 24, 2026 20:49Pavel SkripkinPavel SkripkinScore: 110,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 20:50107,890109,181,25393,945,000999,0002,428,928
2Apr 24, 2026 20:50108,654110,031,50594,610,0001,006,0002,428,928
3Apr 24, 2026 20:50109,677116,414,97995,511,0001,005,0002,433,024
4Apr 24, 2026 20:50109,678112,956,49495,512,0001,005,0002,433,024
5Apr 24, 2026 20:50110,027114,775,09994,828,0001,996,0002,428,928
6Apr 24, 2026 20:50110,038113,463,66995,826,0001,008,0002,424,832
7Apr 24, 2026 20:50110,148109,532,99694,933,0001,998,0002,494,464
8Apr 24, 2026 20:50110,467115,712,57795,207,0002,004,0002,424,832
9Apr 24, 2026 20:50110,737114,926,42196,445,0001,004,0002,330,624