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 listOct 9, 2026 14:08highload-churnerhighload-churnerScore: 14,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 14:1114,81023,255,32213,033,000020,480
2Oct 9, 2026 14:1114,81423,212,96913,037,000020,480
3Oct 9, 2026 14:1114,81523,219,82013,038,000020,480
4Oct 9, 2026 14:1114,83823,328,28713,058,000020,480
5Oct 9, 2026 14:1114,84323,221,90513,062,000020,480
6Oct 9, 2026 14:1114,84623,210,41613,065,000020,480
7Oct 9, 2026 14:1114,85723,248,19313,075,000020,480
8Oct 9, 2026 14:1114,87630,014,65913,091,000024,576
9Oct 9, 2026 14:1114,89426,588,50113,107,000020,480