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:05Josu San MartinJosu San MartinScore: 38,574Success
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:0538,52862,563,03531,911,0001,994,0002,523,136
2Jan 17, 2026 06:0538,52860,901,13732,908,000997,0002,441,216
3Jan 17, 2026 06:0538,53162,863,13231,913,0001,994,0002,457,600
4Jan 17, 2026 06:0538,55564,187,10831,933,0001,995,0002,367,488
5Jan 17, 2026 06:0538,57455,877,97631,949,0001,996,0002,449,408
6Jan 17, 2026 06:0538,63455,863,80931,999,0001,999,0002,445,312
7Jan 17, 2026 06:0538,64256,125,80033,005,0001,000,0002,449,408
8Jan 17, 2026 06:0538,73355,656,47532,080,0002,005,0002,445,312
9Jan 17, 2026 06:0538,74958,818,58233,097,0001,002,0002,453,504