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 listApr 28, 2026 10:12TudyMTudyMScore: 47,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 10:1847,32162,662,62239,612,0002,031,0002,359,296
2Apr 28, 2026 10:1847,36260,897,19840,663,0001,016,0002,371,584
3Apr 28, 2026 10:1847,42856,847,20039,750,0001,987,0002,326,528
4Apr 28, 2026 10:1847,44458,232,82339,763,0001,988,0002,363,392
5Apr 28, 2026 10:1847,47960,760,93139,793,0001,989,0002,367,488
6Apr 28, 2026 10:1847,50457,080,43239,814,0001,990,0002,375,680
7Apr 28, 2026 10:1847,50458,065,07639,814,0001,990,0002,326,528
8Apr 28, 2026 10:1847,52860,508,20340,805,0001,020,0002,371,584
9Apr 28, 2026 10:1847,57957,638,71539,877,0001,993,0002,367,488