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:108QTK8QTKScore: 39,972Success
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:1039,67066,213,16930,921,0003,989,0002,469,888
2Jan 23, 2025 15:1039,93362,185,82031,125,0004,016,0002,433,024
3Jan 23, 2025 15:1039,94060,383,35631,131,0004,016,0002,457,600
4Jan 23, 2025 15:1039,94057,719,84131,131,0004,016,0002,289,664
5Jan 23, 2025 15:1039,97257,185,83131,155,0004,020,0002,289,664
6Jan 23, 2025 15:1039,97657,300,79831,159,0004,020,0002,289,664
7Jan 23, 2025 15:1040,00657,980,36731,182,0004,023,0002,269,184
8Jan 23, 2025 15:1040,08058,320,40432,247,0003,023,0002,486,272
9Jan 23, 2025 15:1040,08257,159,33332,249,0003,023,0002,461,696