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 listFeb 15, 2024 16:24Bernard TeoBernard TeoScore: 56,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2024 16:3756,227114,097,71549,479,51102,240,512
2Feb 15, 2024 16:3756,261116,524,45749,509,57002,228,224
3Feb 15, 2024 16:3756,307121,446,68049,550,19702,236,416
4Feb 15, 2024 16:2456,321103,993,74449,562,36102,240,512
5Feb 15, 2024 16:2456,352116,571,41549,589,65602,256,896
6Feb 15, 2024 16:2456,434114,495,07749,662,16902,224,128