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 17, 2026 00:19M-RochatM-RochatScore: 26,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:2226,50232,530,06622,195,0001,127,0002,113,536
2May 17, 2026 00:2226,52633,442,93422,213,0001,130,0002,113,536
3May 17, 2026 00:2226,53233,318,65822,199,0001,150,0002,113,536
4May 17, 2026 00:2226,53432,039,87222,212,0001,138,0002,113,536
5May 17, 2026 00:2226,54232,337,27322,212,0001,145,0002,113,536
6May 17, 2026 00:2226,58133,275,41322,244,0001,148,0002,113,536
7May 17, 2026 00:2226,58433,992,48422,230,0001,164,0002,113,536
8May 17, 2026 00:2226,60532,045,61722,267,0001,146,0002,113,536
9May 17, 2026 00:2226,65732,305,77722,302,0001,157,0002,113,536