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 listJun 23, 2026 07:01Victor MerckléVictor MerckléScore: 5,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 07:045,80013,935,6345,104,00002,113,536
2Jun 23, 2026 07:045,80312,600,6965,107,00002,113,536
3Jun 23, 2026 07:045,82512,717,9015,126,00002,113,536
4Jun 23, 2026 07:045,87712,678,2385,172,00002,113,536
5Jun 23, 2026 07:045,93213,008,4865,221,00002,113,536
6Jun 23, 2026 07:045,93512,715,7025,223,00002,113,536
7Jun 23, 2026 07:045,97612,709,4355,259,00002,113,536
8Jun 23, 2026 07:045,99012,779,7695,272,00002,113,536
9Jun 23, 2026 07:046,01712,758,5635,295,00002,113,536