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 22, 2024 15:27Maxim ElchuginMaxim ElchuginScore: 2,146,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 15:221,420,870584,049,410525,721,75302,207,744
2May 22, 2024 15:271,556,328638,056,360575,841,32502,260,992
3May 22, 2024 15:221,938,031778,080,684717,071,63702,215,936
4May 22, 2024 15:272,146,953852,992,498794,372,70702,289,664
5May 22, 2024 15:222,213,108880,846,568818,850,01402,203,648
6May 22, 2024 15:272,801,7801,097,097,0911,036,658,50202,277,376