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 listJul 2, 2026 06:08Victor MerckléVictor MerckléScore: 4,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 06:104,58013,183,9294,031,00002,117,632stderr
2Jul 2, 2026 06:104,61911,790,4544,065,00002,117,632stderr
3Jul 2, 2026 06:104,62111,818,1064,067,00002,117,632stderr
4Jul 2, 2026 06:104,70211,857,3554,138,00002,117,632stderr
5Jul 2, 2026 06:104,71511,854,1034,150,00002,117,632stderr
6Jul 2, 2026 06:104,72111,886,3254,155,00002,117,632stderr
7Jul 2, 2026 06:104,86112,000,1114,278,00002,117,632stderr
8Jul 2, 2026 06:104,99012,127,9094,392,00002,117,632stderr
9Jul 2, 2026 06:105,13712,233,0824,521,00002,117,632stderr