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 9, 2025 12:52Alex KentAlex KentScore: 726,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 12:52724,878659,145,795635,894,0001,999,0002,289,664
2Jan 9, 2025 12:52725,297661,274,471637,261,0001,000,0002,289,664
3Jan 9, 2025 12:52725,970667,168,479636,855,0001,999,0002,289,664
4Jan 9, 2025 12:52726,365660,726,643639,201,00002,383,872
5Jan 9, 2025 12:52726,528668,254,429639,345,00002,289,664
6Jan 9, 2025 12:52726,813664,670,949637,597,0001,998,0002,265,088
7Jan 9, 2025 12:52726,998671,638,440637,759,0001,999,0002,289,664
8Jan 9, 2025 12:52727,490669,165,004639,191,0001,000,0002,273,280
9Jan 9, 2025 12:52728,573659,357,302640,144,0001,000,0002,273,280