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:18TudyMTudyMScore: 42,136Success
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:2341,90352,764,93634,882,0001,993,0002,375,680
2Apr 28, 2026 10:2341,93053,825,48034,905,0001,994,0002,383,872
3Apr 28, 2026 10:2342,07258,984,20935,023,0002,001,0002,383,872
4Apr 28, 2026 10:2342,13555,207,66335,075,0002,004,0002,326,528
5Apr 28, 2026 10:2342,13654,038,82036,078,0001,002,0002,363,392
6Apr 28, 2026 10:2342,23552,579,98136,163,0001,004,0002,367,488
7Apr 28, 2026 10:2342,25053,342,85936,176,0001,004,0002,371,584
8Apr 28, 2026 10:2342,28255,250,02436,204,0001,005,0002,375,680
9Apr 28, 2026 10:2342,30652,767,89836,224,0001,006,0002,367,488