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 listJul 18, 2023 17:20Bernard TeoBernard TeoScore: 71,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2023 17:2071,294127,725,96762,739,06502,252,800
2Jul 18, 2023 17:2071,466122,415,27462,890,46702,252,800
3Jul 18, 2023 17:2071,523120,376,30962,940,14902,252,800
4Jul 18, 2023 17:2071,650129,903,86663,051,65602,260,992
5Jul 18, 2023 17:2071,755123,940,74263,144,30302,256,896
6Jul 18, 2023 17:2071,913126,697,57763,283,54202,252,800