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 26, 2025 10:338QTK8QTKScore: 33,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 26, 2025 10:3332,95750,407,15625,002,0004,000,0002,453,504
2Jan 26, 2025 10:3332,97052,802,84925,012,0004,002,0002,457,600
3Jan 26, 2025 10:3332,97453,498,08125,015,0004,002,0002,404,352
4Jan 26, 2025 10:3332,97651,585,90726,017,0003,002,0002,289,664
5Jan 26, 2025 10:3333,05050,963,06025,073,0004,011,0002,289,664
6Jan 26, 2025 10:3333,22355,737,58225,204,0004,032,0002,363,392
7Jan 26, 2025 10:3333,27051,471,67926,250,0003,028,0002,289,664
8Jan 26, 2025 10:3333,34750,455,26725,298,0004,047,0002,469,888
9Jan 26, 2025 10:3333,39353,726,87125,333,0004,053,0002,465,792