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 listSep 3, 2026 12:12Victor MerckléVictor MerckléScore: 2,628Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 02:41Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:192,62211,013,9182,308,000024,576stderr
2Sep 3, 2026 12:192,62211,017,5262,308,000024,576stderr
3Sep 3, 2026 12:192,62510,489,9672,310,000024,576stderr
4Sep 3, 2026 12:192,62810,471,7682,313,000024,576stderr
5Sep 3, 2026 12:192,62810,381,2782,313,000024,576stderr
6Sep 3, 2026 12:192,62910,468,4372,314,000024,576stderr
7Sep 3, 2026 12:192,64310,527,7052,326,000024,576stderr
8Sep 3, 2026 12:192,64810,399,0792,331,000024,576stderr
9Sep 3, 2026 12:192,76511,196,6572,434,000024,576stderr