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:31Bernard TeoBernard TeoScore: 6,816,733Success
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:066,756,2076,018,498,1535,945,462,51502,260,992
2Jul 13, 2023 17:316,770,8116,019,525,5345,958,313,93702,252,800
3Jul 13, 2023 17:066,787,6676,033,379,1955,973,147,37902,252,800
4Jul 13, 2023 17:316,816,7336,063,568,8945,998,725,44002,252,800
5Jul 13, 2023 17:066,826,4516,066,718,4076,007,277,30002,256,896
6Jul 13, 2023 17:316,828,6026,080,514,4916,009,170,10802,248,704