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 04:41apuxbtapuxbtScore: 342,723Success
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 04:39319,248339,570,015280,938,46602,236,416
2Dec 1, 2022 04:39319,942346,790,265281,549,02702,220,032
3Dec 1, 2022 04:39320,054336,867,134281,647,42802,228,224
4Dec 1, 2022 04:41342,723364,973,813301,596,49302,240,512
5Dec 1, 2022 04:41342,822371,437,099301,683,70502,232,320
6Dec 1, 2022 04:41343,027358,631,565301,863,48002,232,320