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 05:35Josu San MartinJosu San MartinScore: 42,067Success
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 05:3541,99860,872,53834,961,0001,997,0002,281,472
2Jan 17, 2026 05:3542,03058,346,60734,987,0001,999,0002,449,408
3Jan 17, 2026 05:3542,04564,631,71835,000,0002,000,0002,281,472
4Jan 17, 2026 05:3542,06760,418,41436,019,0001,000,0002,441,216
5Jan 17, 2026 05:3542,06759,233,93236,019,0001,000,0002,453,504
6Jan 17, 2026 05:3542,07058,625,82135,021,0002,001,0002,453,504
7Jan 17, 2026 05:3542,07457,875,22536,025,0001,000,0002,437,120
8Jan 17, 2026 05:3542,14960,557,02135,087,0002,004,0002,441,216
9Jan 17, 2026 05:3542,18860,754,59536,122,0001,003,0002,449,408