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 listJan 23, 2025 10:088QTK8QTKScore: 78,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 10:0878,28994,124,69864,901,0003,993,0002,285,568
2Jan 23, 2025 10:0878,42495,000,86266,013,0003,000,0002,289,664
3Jan 23, 2025 10:0878,47793,254,06265,057,0004,003,0002,465,792
4Jan 23, 2025 10:0878,73692,032,88265,272,0004,016,0002,289,664
5Jan 23, 2025 10:0878,74294,619,88365,276,0004,017,0002,285,568
6Jan 23, 2025 10:0878,75291,077,26865,285,0004,017,0002,428,928
7Jan 23, 2025 10:0878,94297,605,36366,449,0003,020,0002,371,584
8Jan 23, 2025 10:0879,07294,382,48966,558,0003,025,0002,285,568
9Jan 23, 2025 10:0879,23394,128,46466,694,0003,031,0002,465,792