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:42mgildermgilderScore: 182,857Success
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:42182,356182,312,479159,471,0001,002,0002,359,296
2Jan 17, 2026 02:42182,434186,424,559159,539,0001,003,0002,289,664
3Jan 17, 2026 02:42182,458184,941,464160,563,00002,285,568
4Jan 17, 2026 02:42182,818192,406,783158,882,0001,998,0002,367,488
5Jan 17, 2026 02:42182,857189,301,989158,916,0001,998,0002,289,664
6Jan 17, 2026 02:42182,972183,368,842159,015,0002,000,0002,363,392
7Jan 17, 2026 02:42183,020182,875,045159,058,0002,000,0002,289,664
8Jan 17, 2026 02:42183,859188,191,480159,799,0001,997,0002,285,568
9Jan 17, 2026 02:42184,461184,892,129162,326,00002,367,488