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:15Victor MerckléVictor MerckléScore: 6,475Success
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:186,38213,065,7355,617,00002,113,536
2Jun 23, 2026 02:186,44213,177,1475,669,00002,113,536
3Jun 23, 2026 02:186,44813,171,1295,675,00002,113,536
4Jun 23, 2026 02:186,46513,179,6115,690,00002,113,536
5Jun 23, 2026 02:186,47513,259,7035,698,00002,113,536
6Jun 23, 2026 02:186,52013,319,5305,738,00002,113,536
7Jun 23, 2026 02:186,55713,266,0435,771,00002,113,536
8Jun 23, 2026 02:186,57113,240,7285,783,00002,113,536
9Jun 23, 2026 02:186,58213,565,3645,793,00002,113,536