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 08:42Victor MerckléVictor MerckléScore: 5,819Success
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 08:455,69812,524,8115,015,00002,113,536
2Jun 23, 2026 08:455,71712,511,6015,031,00002,113,536
3Jun 23, 2026 08:455,76812,571,3835,076,00002,113,536
4Jun 23, 2026 08:455,81812,826,5305,120,00002,113,536
5Jun 23, 2026 08:455,81912,580,9625,121,00002,113,536
6Jun 23, 2026 08:455,82512,914,4505,126,00002,113,536
7Jun 23, 2026 08:455,82612,576,5555,127,00002,113,536
8Jun 23, 2026 08:455,83812,915,2745,138,00002,113,536
9Jun 23, 2026 08:455,83812,535,0365,138,00002,113,536