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 listMay 26, 2025 06:15E SequeiraE SequeiraScore: 93,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:1592,73057,009,14632,292,0002,018,0002,285,568
2May 26, 2025 06:1592,88655,460,19633,358,0001,010,0002,519,040
3May 26, 2025 06:1592,93259,885,13334,385,00002,285,568
4May 26, 2025 06:1593,11161,073,74133,438,0001,013,0002,265,088
5May 26, 2025 06:1593,11955,655,50233,441,0001,013,0002,383,872
6May 26, 2025 06:1593,30060,830,94533,506,0001,015,0002,285,568
7May 26, 2025 06:1593,33557,867,60433,519,0001,015,0002,260,992
8May 26, 2025 06:1593,55470,558,62633,597,0001,018,0002,285,568
9May 26, 2025 06:1593,60557,830,30433,616,0001,018,0002,285,568