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:03Maxim ElchuginMaxim ElchuginScore: 22,321,467Success
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:0322,307,6968,318,338,5338,253,847,46902,289,664
2May 22, 2024 15:0322,321,4678,321,307,1058,258,942,80202,289,664
3May 22, 2024 15:0322,365,8498,336,998,7888,275,363,98202,285,568