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 listFeb 7, 2026 04:21vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 05:25M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 05:2508,480,6381,121,00002,113,536expected "6442459076 ", got "1 "
2May 17, 2026 05:25010,683,8301,130,00002,113,536expected "6442459076 ", got "1 "
3May 17, 2026 05:2508,767,6021,189,00002,113,536expected "6442459076 ", got "1 "
4Feb 7, 2026 04:213,37527,345,169990,0001,980,0002,502,656
5Feb 7, 2026 04:213,38624,744,872993,0001,987,0002,502,656
6Feb 7, 2026 04:213,40218,038,729998,0001,996,0002,498,560
7Feb 7, 2026 04:213,43620,757,0091,008,0002,016,0002,502,656
8Feb 7, 2026 04:213,50123,485,4961,027,0002,054,0002,281,472
9Feb 7, 2026 04:213,57720,204,8521,049,0002,099,0002,482,176