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 15:008QTK8QTKScore: 39,963Success
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 15:0039,73357,725,64131,968,0002,997,0002,314,240
2Jan 23, 2025 15:0039,74556,686,93730,979,0003,997,0002,461,696
3Jan 23, 2025 15:0039,84055,298,28531,053,0004,006,0002,433,024
4Jan 23, 2025 15:0039,86359,783,48631,070,0004,009,0002,465,792
5Jan 23, 2025 15:0039,96360,453,63431,148,0004,019,0002,289,664
6Jan 23, 2025 15:0039,96862,962,33631,153,0004,019,0002,289,664
7Jan 23, 2025 15:0040,00562,014,84531,181,0004,023,0002,412,544
8Jan 23, 2025 15:0040,01959,197,84331,193,0004,024,0002,289,664
9Jan 23, 2025 15:0040,37661,391,83731,471,0004,060,0002,457,600