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 12, 2023 23:38Yurkov AlekseyYurkov AlekseyScore: 121,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2023 23:38120,951105,614,25944,752,01402,265,088
2May 12, 2023 23:38121,495118,418,41144,953,03102,260,992
3May 12, 2023 23:38122,156114,263,73945,197,75802,256,896