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:26M-RochatM-RochatScore: 24,686Success
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:3124,37832,927,35620,324,0001,129,0002,113,536
2May 18, 2026 09:3124,53231,775,78120,384,0001,205,0002,113,536
3May 18, 2026 09:3124,60132,293,53220,515,0001,134,0002,113,536
4May 18, 2026 09:3124,63531,526,98320,525,0001,154,0002,113,536
5May 18, 2026 09:3124,68632,907,37420,567,0001,157,0002,113,536
6May 18, 2026 09:3124,69830,926,76720,577,0001,158,0002,113,536
7May 18, 2026 09:3124,70330,803,89420,591,0001,148,0002,113,536
8May 18, 2026 09:3124,72333,305,57520,599,0001,158,0002,113,536
9May 18, 2026 09:3124,73030,982,80320,608,0001,155,0002,113,536