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:26Andrew TsibinAndrew TsibinScore: 69,897Success
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:2764,12133,748,56220,255,0003,470,00036,864
2Jul 29, 2026 21:2764,86234,087,56519,540,0004,459,0002,129,920
3Jul 29, 2026 21:2767,83235,092,89319,623,0005,475,0002,129,920
4Jul 29, 2026 21:2769,87035,929,11620,929,0004,923,00036,864
5Jul 29, 2026 21:2769,89736,531,95919,620,0006,242,0002,129,920
6Jul 29, 2026 21:2774,74837,713,01219,837,0007,820,0002,129,920
7Jul 29, 2026 21:2776,23239,399,81920,024,0008,182,0002,129,920
8Jul 29, 2026 21:2777,05149,841,66623,410,0005,099,00036,864
9Jul 29, 2026 21:2777,40838,655,79820,447,0008,194,00036,864