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,370,088Success
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,304,6836,491,861,6666,428,121,06002,248,704
2Jul 13, 2023 17:297,370,0886,549,459,8186,485,677,50502,240,512
3Jul 13, 2023 17:297,379,5246,572,891,7306,493,981,42202,252,800