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 21, 2026 19:55M-RochatM-RochatScore: 23,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:5823,49230,742,70919,598,0001,075,0002,113,536
2May 21, 2026 19:5823,60132,212,23019,694,0001,075,0002,113,536
3May 21, 2026 19:5823,60631,000,04619,691,0001,083,0002,113,536
4May 21, 2026 19:5823,62331,903,17819,708,0001,081,0002,113,536
5May 21, 2026 19:5823,67531,684,73619,768,0001,066,0002,113,536
6May 21, 2026 19:5823,68031,073,70119,757,0001,082,0002,113,536
7May 21, 2026 19:5823,81532,480,14919,928,0001,030,0002,113,536
8May 21, 2026 19:5823,85432,745,28119,922,0001,070,0002,113,536
9May 21, 2026 19:5823,88830,393,10219,986,0001,036,0002,113,536