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 11, 2026 05:28Victor MerckléVictor MerckléScore: 7,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 05:307,68814,026,7186,766,00002,113,536
2Jun 11, 2026 05:307,76714,126,0856,835,00002,113,536
3Jun 11, 2026 05:307,81114,055,0656,874,00002,113,536
4Jun 11, 2026 05:307,82214,555,6786,884,00002,113,536
5Jun 11, 2026 05:307,82214,063,8966,884,00002,113,536
6Jun 11, 2026 05:307,82814,295,6866,889,00002,113,536
7Jun 11, 2026 05:307,84414,097,7946,903,00002,113,536
8Jun 11, 2026 05:307,84614,082,9826,905,00002,113,536
9Jun 11, 2026 05:307,85314,185,8626,911,00002,113,536