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 16, 2026 21:30M-RochatM-RochatScore: 34,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 21:3834,31338,753,77029,041,0001,155,0002,113,536
2May 16, 2026 21:3834,39239,997,05229,141,0001,124,0002,113,536
3May 16, 2026 21:3834,41740,286,86429,136,0001,151,0002,113,536
4May 16, 2026 21:3834,50040,706,96229,321,0001,039,0002,113,536
5May 16, 2026 21:3834,53539,715,63629,248,0001,143,0002,113,536
6May 16, 2026 21:3834,57539,167,27729,273,0001,153,0002,113,536
7May 16, 2026 21:3834,57739,852,84729,276,0001,152,0002,113,536
8May 16, 2026 21:3834,60239,037,49629,419,0001,031,0002,113,536
9May 16, 2026 21:3834,67541,449,52929,485,0001,029,0002,113,536