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 listOct 3, 2026 07:18Karthik ReddyKarthik ReddyScore: 3,029Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 20:43Andrew Epstein31.37CustomSolution Held
Oct 5, 2026 17:56Andrew Epstein31.37CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 07:213,00911,267,8522,648,000020,480
2Oct 3, 2026 07:213,01011,346,4482,649,000020,480
3Oct 3, 2026 07:213,01411,329,9852,653,000020,480
4Oct 3, 2026 07:213,01911,343,3152,657,000020,480
5Oct 3, 2026 07:213,02911,359,4422,666,000020,480
6Oct 3, 2026 07:213,03111,286,6722,668,000020,480
7Oct 3, 2026 07:213,03411,578,4862,670,000020,480
8Oct 3, 2026 07:213,06913,883,9472,701,000020,480
9Oct 3, 2026 07:213,18911,367,4172,807,000020,480