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:51Bernard TeoBernard TeoScore: 543,874Success
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:51543,770531,510,820478,517,31802,260,992
2Jul 13, 2023 17:51543,874537,795,003478,608,85602,248,704
3Jul 13, 2023 17:51544,036542,470,934478,751,63002,248,704