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,196Success
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:2425,96332,130,66521,728,0001,120,0002,113,536
2May 17, 2026 00:2426,14432,436,50021,880,0001,127,0002,113,536
3May 17, 2026 00:2426,16136,257,30921,872,0001,150,0002,113,536
4May 17, 2026 00:2426,16431,786,13121,877,0001,148,0002,113,536
5May 17, 2026 00:2426,19633,411,85821,906,0001,147,0002,113,536
6May 17, 2026 00:2426,23733,063,13121,941,0001,148,0002,113,536
7May 17, 2026 00:2426,25431,711,95621,964,0001,140,0002,113,536
8May 17, 2026 00:2426,27132,701,95421,962,0001,157,0002,113,536
9May 17, 2026 00:2426,31031,854,36022,099,0001,054,0002,113,536