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 09:01Victor MerckléVictor MerckléScore: 5,839Success
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 09:045,69612,544,1595,013,00002,113,536
2Jun 23, 2026 09:045,81712,879,2085,119,00002,113,536
3Jun 23, 2026 09:045,83012,724,8275,131,00002,113,536
4Jun 23, 2026 09:045,83012,571,3935,131,00002,113,536
5Jun 23, 2026 09:045,83912,837,9555,139,00002,113,536
6Jun 23, 2026 09:045,85512,941,6195,153,00002,113,536
7Jun 23, 2026 09:045,86213,013,5255,159,00002,113,536
8Jun 23, 2026 09:045,86312,963,9705,160,00002,113,536
9Jun 23, 2026 09:046,05713,062,7955,331,00002,113,536