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 28, 2024 15:57zielajzielajScore: 3,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 15:573,72718,025,2312,187,0001,093,0002,457,600
2Dec 28, 2024 15:573,74119,669,1232,195,0001,097,0002,273,280
3Dec 28, 2024 15:573,76122,340,8762,207,0001,103,0002,535,424
4Dec 28, 2024 15:573,76523,861,2582,209,0001,104,0002,461,696
5Dec 28, 2024 15:573,77520,308,1122,215,0001,107,0002,461,696
6Dec 28, 2024 15:573,85217,793,5032,260,0001,130,0002,461,696
7Dec 28, 2024 15:573,92417,942,9132,302,0001,151,0002,453,504
8Dec 28, 2024 15:573,94925,260,8202,317,0001,158,0002,461,696
9Dec 28, 2024 15:573,95923,576,8492,323,0001,161,0002,465,792