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 17, 2026 20:21zielajzielajScore: 2,707Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 23:03M-Rochat25.30CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 20:232,58712,759,0382,277,00002,113,536
2May 17, 2026 20:232,63212,048,9472,317,00002,117,632
3May 17, 2026 20:232,67311,339,2832,353,00002,113,536
4May 17, 2026 20:232,6899,901,7122,367,00002,113,536
5May 17, 2026 20:232,70711,779,6502,383,00002,113,536
6May 17, 2026 20:232,71012,985,6922,385,00002,113,536
7May 17, 2026 20:233,07912,237,8902,710,00002,113,536
8May 17, 2026 20:233,16212,633,7032,783,00002,113,536
9May 17, 2026 20:233,32612,340,1142,927,00002,113,536