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 09:558QTK8QTKScore: 83,594Success
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 09:5583,10794,537,26269,127,0004,007,0002,457,600
2Jan 23, 2025 09:5583,26798,574,95969,260,0004,015,0002,457,600
3Jan 23, 2025 09:5583,394101,961,93469,366,0004,021,0002,469,888
4Jan 23, 2025 09:5583,58398,129,24070,531,0003,022,0002,310,144
5Jan 23, 2025 09:5583,594105,476,07670,540,0003,023,0002,469,888
6Jan 23, 2025 09:5583,62398,245,32070,564,0003,024,0002,281,472
7Jan 23, 2025 09:5583,96199,183,22970,891,0002,995,0002,461,696
8Jan 23, 2025 09:5584,06697,628,45169,980,0003,998,0002,293,760
9Jan 23, 2025 09:5584,18699,205,11971,081,0003,003,0002,289,664