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:09Bernard TeoBernard TeoScore: 6,801,368Success
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:096,790,2556,031,609,5725,975,424,63302,260,992
2Jul 13, 2023 17:096,801,3686,058,710,8285,985,204,13202,269,184
3Jul 13, 2023 17:096,823,3646,067,071,7186,004,560,52502,252,800