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 listJan 13, 2026 00:08Josu San MartinJosu San MartinScore: 70,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:0869,93050,284,15323,884,0001,990,0002,363,392
2Jan 13, 2026 00:0870,04153,593,86023,922,0001,993,0002,289,664
3Jan 13, 2026 00:0870,06550,921,02723,930,0001,994,0002,367,488
4Jan 13, 2026 00:0870,13053,417,92323,952,0001,996,0002,367,488
5Jan 13, 2026 00:0870,15953,013,60224,961,000998,0002,367,488
6Jan 13, 2026 00:0870,27350,904,31324,001,0002,000,0002,289,664
7Jan 13, 2026 00:0870,37859,636,72324,037,0002,003,0002,375,680
8Jan 13, 2026 00:0870,38456,716,91224,039,0002,003,0002,363,392
9Jan 13, 2026 00:0870,38449,283,18824,039,0002,003,0002,375,680