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 11:098QTK8QTKScore: 77,134Success
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 11:0976,86797,107,16564,615,0003,028,0002,465,792
2Jan 23, 2025 11:0976,93591,210,21264,672,0003,031,0002,478,080
3Jan 23, 2025 11:0976,94195,360,81865,687,0002,021,0002,473,984
4Jan 23, 2025 11:0977,11097,985,87863,866,0003,991,0002,285,568
5Jan 23, 2025 11:0977,13494,979,96963,886,0003,992,0002,322,432
6Jan 23, 2025 11:0977,15591,838,61363,903,0003,993,0002,289,664
7Jan 23, 2025 11:0977,20692,859,28164,944,0002,997,0002,461,696
8Jan 23, 2025 11:0977,22390,675,89663,959,0003,997,0002,461,696
9Jan 23, 2025 11:0977,25291,343,45962,984,0004,998,0002,461,696