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 07:32Victor MerckléVictor MerckléScore: 5,871Success
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 07:355,80912,629,0605,112,00002,113,536
2Jun 23, 2026 07:355,83412,646,1285,134,00002,113,536
3Jun 23, 2026 07:355,85512,871,5635,153,00002,113,536
4Jun 23, 2026 07:355,86912,548,4035,165,00002,113,536
5Jun 23, 2026 07:355,87113,004,4305,167,00002,113,536
6Jun 23, 2026 07:355,87613,010,0945,171,00002,113,536
7Jun 23, 2026 07:355,88212,605,0965,177,00002,113,536
8Jun 23, 2026 07:355,89712,963,2855,190,00002,113,536
9Jun 23, 2026 07:356,03612,872,6525,312,00002,113,536