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 listFeb 15, 2023 18:43LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 18:4300000Error: expected "429496539926 ", got "429496526700 "
2Feb 15, 2023 18:4300000Error: expected "429496544827 ", got "429496499359 "
3Feb 15, 2023 18:4300000Error: expected "429496517239 ", got "429496510677 "
4Feb 15, 2023 18:4300000Error: expected "429496521986 ", got "429496513082 "
5Feb 15, 2023 18:4394,327106,073,60634,900,98202,273,280
6Feb 15, 2023 18:4394,746109,988,99535,055,87202,273,280
7Feb 15, 2023 18:4396,42598,051,42335,677,14602,269,184
8Feb 15, 2023 18:4396,443101,960,20035,683,79702,252,800
9Feb 15, 2023 18:4396,45097,638,79835,686,65002,265,088
10Feb 15, 2023 18:4397,34998,990,57836,019,07902,273,280