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 listJan 17, 2026 03:03mgildermgilderScore: 121,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 03:03121,019127,320,227105,493,0001,004,0002,371,584
2Jan 17, 2026 03:03121,026136,203,980105,499,0001,004,0002,289,664
3Jan 17, 2026 03:03121,282142,504,718105,722,0001,006,0002,367,488
4Jan 17, 2026 03:03121,434137,465,784104,865,0001,997,0002,289,664
5Jan 17, 2026 03:03121,624127,385,758105,029,0002,000,0002,478,080
6Jan 17, 2026 03:03121,651129,796,674106,053,0001,000,0002,367,488
7Jan 17, 2026 03:03121,822135,245,197105,200,0002,003,0002,289,664
8Jan 17, 2026 03:03121,906133,638,483106,275,0001,002,0002,289,664
9Jan 17, 2026 03:03122,148137,538,028107,490,00002,363,392