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 listMar 20, 2026 18:22olliecrowolliecrowScore: 102,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 18:23100,69557,507,98935,244,0002,013,0002,301,952
2Mar 20, 2026 18:22100,75459,406,93834,257,0003,022,0002,441,216
3Mar 20, 2026 18:21101,29558,875,45936,467,0001,012,0002,433,024
4Mar 20, 2026 18:23101,37663,330,16035,482,0002,027,0002,342,912
5Mar 20, 2026 18:23101,70869,628,36436,615,0001,017,0002,342,912
6Mar 20, 2026 18:21102,20362,951,95236,820,000995,0002,342,912
7Mar 20, 2026 18:23102,26269,415,78435,846,0001,991,0002,342,912
8Mar 20, 2026 18:23102,33568,145,45534,875,0002,989,0002,330,624
9Mar 20, 2026 18:22102,39765,811,34436,890,000997,0002,437,120
10Mar 20, 2026 18:21102,47668,977,11034,923,0002,993,0002,342,912
11Mar 20, 2026 18:23102,60862,391,52935,967,0001,998,0002,330,624
12Mar 20, 2026 18:22102,75467,767,01636,018,0002,001,0002,449,408