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 13, 2026 12:40Victor MerckléVictor MerckléScore: 7,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 12:436,95913,566,7866,124,00002,113,536
2Jun 13, 2026 12:436,97813,604,7956,141,00002,113,536
3Jun 13, 2026 12:436,98613,630,7726,148,00002,113,536
4Jun 13, 2026 12:437,01213,419,6916,171,00002,113,536
5Jun 13, 2026 12:437,06413,702,4926,217,00002,113,536
6Jun 13, 2026 12:437,07713,627,9306,228,00002,113,536
7Jun 13, 2026 12:437,08513,951,4096,235,00002,113,536
8Jun 13, 2026 12:437,21013,538,0596,345,00002,113,536
9Jun 13, 2026 12:437,30513,871,9156,429,00002,113,536