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 02:30Victor MerckléVictor MerckléScore: 6,572Success
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 02:336,36513,104,7175,602,00002,113,536
2Jun 23, 2026 02:336,38913,133,9695,623,00002,113,536
3Jun 23, 2026 02:336,45314,056,1455,679,00002,113,536
4Jun 23, 2026 02:336,45513,104,2645,681,00002,113,536
5Jun 23, 2026 02:336,57213,727,0625,784,00002,113,536
6Jun 23, 2026 02:336,57713,284,8635,788,00002,113,536
7Jun 23, 2026 02:336,59713,262,1735,806,00002,113,536
8Jun 23, 2026 02:336,74013,678,2495,932,00002,113,536
9Jun 23, 2026 02:336,74613,388,4255,937,00002,113,536