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 12, 2026 20:13janwwwjanwwwScore: 3,782Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 29, 2026 22:13Andrew Epstein30.16CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:153,70211,962,1463,258,00002,113,536
2Oct 12, 2026 20:153,77311,966,0753,321,00002,113,536
3Oct 12, 2026 20:153,77512,482,6673,322,00002,113,536
4Oct 12, 2026 20:153,77811,984,3733,325,00002,113,536
5Oct 12, 2026 20:153,78211,977,6723,329,00002,113,536
6Oct 12, 2026 20:153,78411,996,5153,330,00002,113,536
7Oct 12, 2026 20:153,78911,833,5613,335,00002,113,536
8Oct 12, 2026 20:153,80512,510,3923,349,00002,113,536
9Oct 12, 2026 20:153,80912,014,8393,352,00002,113,536