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 listDec 1, 2022 17:00apuxbtapuxbtScore: 30,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2022 17:0030,38258,797,64225,708,0001,028,0002,265,088
2Dec 1, 2022 17:0030,40952,738,41625,731,0001,029,0002,256,896
3Dec 1, 2022 17:0030,41554,268,37425,736,0001,029,0002,265,088
4Dec 1, 2022 17:0030,48451,227,09825,795,0001,031,0002,260,992
5Dec 1, 2022 17:0030,56053,626,55124,901,0001,992,0002,265,088
6Dec 1, 2022 17:0030,56550,078,71825,901,000996,0002,387,968
7Dec 1, 2022 17:0030,56749,997,63424,907,0001,992,0002,387,968
8Dec 1, 2022 17:0030,58050,588,30025,914,000996,0002,265,088
9Dec 1, 2022 17:0030,67056,413,21224,991,0001,999,0002,265,088
10Dec 1, 2022 17:0030,792109,733,13827,096,99502,240,512
11Dec 1, 2022 17:0030,79990,453,10627,103,10402,232,320
12Dec 1, 2022 17:0030,855102,192,13127,152,11602,236,416