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 listMay 22, 2026 16:49M-RochatM-RochatScore: 24,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 16:5224,78633,204,90820,729,0001,083,0002,113,536
2May 22, 2026 16:5224,82832,338,84120,775,0001,074,0002,113,536
3May 22, 2026 16:5224,83933,231,46820,768,0001,091,0002,113,536
4May 22, 2026 16:5224,86331,804,77420,805,0001,075,0002,113,536
5May 22, 2026 16:5224,94232,405,13120,900,0001,049,0002,113,536
6May 22, 2026 16:5224,94831,234,82020,869,0001,086,0002,113,536
7May 22, 2026 16:5225,02533,177,73720,836,0001,186,0002,113,536
8May 22, 2026 16:5225,04033,890,02720,994,0001,042,0002,113,536
9May 22, 2026 16:5225,07133,609,82721,036,0001,027,0002,113,536