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 09:53TudyMTudyMScore: 46,655Success
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 09:5546,48662,738,72238,913,0001,995,0002,371,584
2Apr 28, 2026 09:5546,63953,160,39639,041,0002,002,0002,363,392
3Apr 28, 2026 09:5546,64558,156,54239,046,0002,002,0002,363,392
4Apr 28, 2026 09:5546,65359,624,06739,053,0002,002,0002,371,584
5Apr 28, 2026 09:5546,65560,561,72639,055,0002,002,0002,379,776
6Apr 28, 2026 09:5546,72358,224,44140,115,0001,002,0002,371,584
7Apr 28, 2026 09:5546,83458,233,98738,199,0003,015,0002,359,296
8Apr 28, 2026 09:5546,93259,365,33038,279,0003,022,0002,375,680
9Apr 28, 2026 09:5546,95657,385,77540,315,0001,007,0002,371,584