TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJul 3, 2026 13:01IlyaIlyaScore: 59,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:0458,88131,306,84620,668,0001,118,0002,113,536
2Jul 3, 2026 13:0458,90231,248,01620,671,0001,123,0002,113,536
3Jul 3, 2026 13:0459,20031,932,70520,664,0001,240,0002,113,536
4Jul 3, 2026 13:0459,21631,447,31820,693,0001,217,0002,113,536
5Jul 3, 2026 13:0459,32931,455,50820,925,0001,027,0002,113,536
6Jul 3, 2026 13:0459,33731,976,23120,738,0001,217,0002,113,536
7Jul 3, 2026 13:0459,41031,883,22020,770,0001,212,0002,113,536
8Jul 3, 2026 13:0459,44031,975,35920,780,0001,213,0002,113,536
9Jul 3, 2026 13:0459,49731,965,18920,780,0001,234,0002,113,536