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 listNov 13, 2024 09:36Dan StolyarovDan StolyarovScore: 672,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 09:36670,061614,273,144585,657,0003,997,0002,281,472
2Nov 13, 2024 09:36670,136616,503,789585,722,0003,998,0002,277,376
3Nov 13, 2024 09:36670,875625,039,677587,369,0003,001,0002,281,472
4Nov 13, 2024 09:36671,670614,506,259588,070,0003,000,0002,469,888
5Nov 13, 2024 09:36672,127618,908,471588,470,0003,002,0002,293,760
6Nov 13, 2024 09:36672,318619,913,768587,643,0003,997,0002,469,888
7Nov 13, 2024 09:36672,490614,167,553587,793,0003,998,0002,469,888
8Nov 13, 2024 09:36672,980619,486,376589,221,0003,001,0002,506,752
9Nov 13, 2024 09:36673,650620,295,097588,814,0003,998,0002,457,600