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 13:40rsk0315rsk0315Score: 114,370Success
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 13:40114,270123,574,66998,547,0002,011,0002,285,568
2Jan 26, 2025 13:40114,340136,565,63798,607,0002,012,0002,289,664
3Jan 26, 2025 13:40114,350124,022,61799,622,0001,006,0002,293,760
4Jan 26, 2025 13:40114,365129,071,94698,629,0002,012,0002,293,760
5Jan 26, 2025 13:40114,370132,526,00699,640,0001,006,0002,289,664
6Jan 26, 2025 13:40114,622125,761,34497,871,0002,996,0002,289,664
7Jan 26, 2025 13:40114,622126,937,55698,870,0001,997,0002,281,472
8Jan 26, 2025 13:40114,622129,653,33898,870,0001,997,0002,281,472
9Jan 26, 2025 13:40114,855130,016,25599,071,0002,001,0002,289,664