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 13, 2023 17:29Bernard TeoBernard TeoScore: 7,376,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 17:297,356,8836,534,146,2266,474,057,09102,244,608
2Jul 13, 2023 17:297,376,2946,559,423,8516,491,138,76302,252,800
3Jul 13, 2023 17:297,390,0606,568,688,7696,503,252,92202,240,512