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 1, 2026 03:16Victor MerckléVictor MerckléScore: 4,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 03:184,64811,791,0414,091,00002,117,632stderr
2Jul 1, 2026 03:184,73411,824,6274,166,00002,117,632stderr
3Jul 1, 2026 03:184,73511,849,3884,167,00002,117,632stderr
4Jul 1, 2026 03:184,74011,840,4964,172,00002,117,632stderr
5Jul 1, 2026 03:184,75112,189,7094,181,00002,117,632stderr
6Jul 1, 2026 03:184,75511,848,7484,185,00002,117,632stderr
7Jul 1, 2026 03:184,75611,834,6454,186,00002,117,632stderr
8Jul 1, 2026 03:184,76511,877,9984,194,00002,117,632stderr
9Jul 1, 2026 03:184,77111,841,0634,199,00002,117,632stderr