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 23, 2025 08:268QTK8QTKScore: 300,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:26300,173290,610,656262,151,0002,001,0002,523,136
2Jan 23, 2025 08:26300,368288,050,640262,322,0002,002,0002,285,568
3Jan 23, 2025 08:26300,589293,665,533261,513,0003,005,0002,289,664
4Jan 23, 2025 08:26300,595288,101,706263,523,0001,001,0002,260,992
5Jan 23, 2025 08:26300,895296,019,521263,789,000999,0002,375,680
6Jan 23, 2025 08:26301,023290,030,564262,901,0001,999,0002,285,568
7Jan 23, 2025 08:26301,163288,016,138262,023,0003,000,0002,285,568
8Jan 23, 2025 08:26301,222288,862,169262,075,0003,000,0002,269,184
9Jan 23, 2025 08:26302,030291,557,872263,788,0001,998,0002,523,136