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 listJan 17, 2026 06:56Josu San MartinJosu San MartinScore: 36,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 06:5636,23150,072,45630,855,0001,028,0002,449,408
2Jan 17, 2026 06:5636,24854,665,56030,902,000996,0002,289,664
3Jan 17, 2026 06:5636,28054,060,97529,931,0001,995,0002,457,600
4Jan 17, 2026 06:5636,31153,756,33329,957,0001,997,0002,457,600
5Jan 17, 2026 06:5636,33953,707,14529,980,0001,998,0002,359,296
6Jan 17, 2026 06:5636,37753,590,49931,012,0001,000,0002,281,472
7Jan 17, 2026 06:5636,41158,941,22530,040,0002,002,0002,449,408
8Jan 17, 2026 06:5636,41358,356,00530,041,0002,002,0002,449,408
9Jan 17, 2026 06:5636,42254,668,93130,048,0002,003,0002,457,600