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 18, 2026 09:21M-RochatM-RochatScore: 28,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 09:2428,73635,883,62324,185,0001,103,0002,113,536
2May 18, 2026 09:2428,78634,521,29724,232,0001,100,0002,113,536
3May 18, 2026 09:2428,82036,143,91424,250,0001,112,0002,113,536
4May 18, 2026 09:2428,94035,170,49124,370,0001,098,0002,113,536
5May 18, 2026 09:2428,94537,963,97424,311,0001,161,0002,113,536
6May 18, 2026 09:2428,96535,530,81824,362,0001,128,0002,113,536
7May 18, 2026 09:2428,98236,577,25624,382,0001,123,0002,113,536
8May 18, 2026 09:2428,99436,357,78924,389,0001,126,0002,113,536
9May 18, 2026 09:2429,05436,703,20624,480,0001,088,0002,113,536