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 15, 2023 06:40Bernard TeoBernard TeoScore: 524,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 06:41523,920527,698,113461,049,90602,256,896
2Jul 15, 2023 06:41524,032533,325,556461,148,47302,252,800
3Jul 15, 2023 06:40524,056524,336,981461,169,69902,256,896
4Jul 15, 2023 06:40524,097515,465,695461,205,15902,256,896
5Jul 15, 2023 06:40524,113522,670,952461,219,66102,256,896
6Jul 15, 2023 06:41524,430519,346,945461,498,07202,256,896