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:59TudyMTudyMScore: 46,970Success
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:0146,76458,570,19140,150,0001,003,0002,383,872
2Apr 28, 2026 10:0146,81558,102,32939,189,0002,009,0002,367,488
3Apr 28, 2026 10:0146,82754,694,04539,198,0002,010,0002,371,584
4Apr 28, 2026 10:0146,91156,861,09140,276,0001,006,0002,367,488
5Apr 28, 2026 10:0146,97058,767,92640,326,0001,008,0002,322,432
6Apr 28, 2026 10:0146,97056,408,62039,318,0002,016,0002,326,528
7Apr 28, 2026 10:0147,02657,058,76239,365,0002,018,0002,326,528
8Apr 28, 2026 10:0147,04359,728,25140,389,0001,009,0002,367,488
9Apr 28, 2026 10:0147,05363,363,40640,398,0001,009,0002,375,680