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 listMay 18, 2026 16:40M-RochatM-RochatScore: 23,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 16:4223,63030,489,75519,760,0001,035,0002,113,536
2May 18, 2026 16:4223,69733,704,39919,826,0001,028,0002,113,536
3May 18, 2026 16:4223,71532,657,09619,845,0001,025,0002,113,536
4May 18, 2026 16:4223,72132,442,31219,840,0001,035,0002,113,536
5May 18, 2026 16:4223,73531,510,52119,739,0001,148,0002,113,536
6May 18, 2026 16:4223,74030,177,58619,746,0001,146,0002,113,536
7May 18, 2026 16:4223,79830,601,71519,911,0001,032,0002,113,536
8May 18, 2026 16:4223,82632,288,92319,938,0001,029,0002,113,536
9May 18, 2026 16:4224,06032,308,11720,148,0001,025,0002,113,536