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:43M-RochatM-RochatScore: 25,914Success
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:4625,80934,913,99921,625,0001,087,0002,113,536
2May 22, 2026 16:4625,84832,920,86021,664,0001,083,0002,113,536
3May 22, 2026 16:4625,86533,375,38021,682,0001,080,0002,117,632
4May 22, 2026 16:4625,89533,215,71321,713,0001,075,0002,113,536
5May 22, 2026 16:4625,91432,330,27921,717,0001,088,0002,113,536
6May 22, 2026 16:4625,95035,091,92121,671,0001,165,0002,113,536
7May 22, 2026 16:4625,95535,164,29821,757,0001,084,0002,113,536
8May 22, 2026 16:4625,99033,903,04321,711,0001,161,0002,113,536
9May 22, 2026 16:4626,04035,203,50221,866,0001,050,0002,113,536