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 8, 2026 02:52Karthik ReddyKarthik ReddyScore: 2,493Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 13, 2026 12:02Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2026 02:542,47010,993,4942,174,000020,480
2Oct 8, 2026 02:542,48611,492,8722,188,000020,480
3Oct 8, 2026 02:542,48610,991,4822,188,000020,480
4Oct 8, 2026 02:542,48911,426,5362,191,000020,480
5Oct 8, 2026 02:542,49311,074,7012,194,000020,480
6Oct 8, 2026 02:542,51011,520,5372,209,000020,480
7Oct 8, 2026 02:542,52911,019,9512,226,000020,480
8Oct 8, 2026 02:542,56910,965,8302,261,000020,480
9Oct 8, 2026 02:542,72311,325,7802,397,000020,480