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 02:39mgildermgilderScore: 194,668Success
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 02:39193,207193,605,910169,022,0001,000,0002,289,664
2Jan 17, 2026 02:39193,972201,001,092169,691,0001,004,0002,363,392
3Jan 17, 2026 02:39194,125201,285,447169,831,000999,0002,367,488
4Jan 17, 2026 02:39194,210201,035,183169,906,000999,0002,289,664
5Jan 17, 2026 02:39194,668194,280,187170,307,0001,001,0002,289,664
6Jan 17, 2026 02:39194,761191,189,597170,388,0001,002,0002,289,664
7Jan 17, 2026 02:39194,839197,296,382170,456,0001,002,0002,367,488
8Jan 17, 2026 02:39195,035196,213,028170,628,0001,003,0002,347,008
9Jan 17, 2026 02:39195,795194,062,038171,299,0001,001,0002,465,792