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 3, 2026 22:45olliecrowolliecrowScore: 167,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:45163,72294,011,52813,125,00047,452,0002,371,584
2Mar 3, 2026 22:45165,96587,683,16412,080,00049,327,0002,375,680
3Mar 3, 2026 22:44166,49790,841,47315,148,00046,456,0002,285,568
4Mar 3, 2026 22:44166,89786,372,77612,948,00048,804,0002,285,568
5Mar 3, 2026 22:45167,38188,308,82111,986,00049,945,0002,367,488
6Mar 3, 2026 22:45167,70090,900,63813,010,00049,039,0002,498,560
7Mar 3, 2026 22:44168,53289,054,20611,063,00051,294,0002,285,568
8Mar 3, 2026 22:45169,59789,312,62614,940,00047,811,0002,285,568
9Mar 3, 2026 22:45169,60888,843,22713,945,00048,810,0002,285,568