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 29, 2026 21:08Andrew TsibinAndrew TsibinScore: 70,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 21:0964,18133,750,66720,468,0003,279,0002,113,536
2Jul 29, 2026 21:0967,45636,245,93120,419,0004,540,00020,480
3Jul 29, 2026 21:0968,59735,292,41820,566,0004,815,0002,113,536
4Jul 29, 2026 21:0969,19736,409,15020,682,0004,921,0002,113,536
5Jul 29, 2026 21:0970,96436,294,70920,596,0005,661,0002,113,536
6Jul 29, 2026 21:0971,04036,329,36320,455,0005,830,00020,480
7Jul 29, 2026 21:0972,91337,784,55220,505,0006,473,0002,113,536
8Jul 29, 2026 21:0977,57239,529,43420,485,0008,217,0002,113,536
9Jul 29, 2026 21:0991,84356,602,49325,026,0008,956,0002,113,536