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:46olliecrowolliecrowScore: 101,741Success
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:46100,87857,741,76734,299,0003,026,0002,342,912
2Mar 20, 2026 18:45100,99561,404,89034,339,0003,029,0002,326,528
3Mar 20, 2026 18:44101,14658,697,48735,402,0002,022,0002,441,216
4Mar 20, 2026 18:44101,21456,122,61736,437,0001,012,0002,293,760
5Mar 20, 2026 18:45101,42260,406,38035,498,0002,028,0002,437,120
6Mar 20, 2026 18:45101,73266,112,63135,607,0002,034,0002,441,216
7Mar 20, 2026 18:45101,74162,724,93335,610,0002,034,0002,342,912
8Mar 20, 2026 18:45102,25962,319,47435,845,0001,991,0002,441,216
9Mar 20, 2026 18:46102,32468,496,82836,864,000996,0002,342,912
10Mar 20, 2026 18:44102,38965,562,36735,891,0001,993,0002,453,504
11Mar 20, 2026 18:45102,41464,203,67235,899,0001,994,0002,441,216
12Mar 20, 2026 18:46102,65771,885,72535,984,0001,999,0002,342,912