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 listAug 2, 2022 08:18Robert BurkeRobert BurkeScore: 63,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:1863,39242,236,00122,436,0001,019,0002,428,928
2Aug 2, 2022 08:1863,48446,810,02923,489,00002,433,024
3Aug 2, 2022 08:1863,53849,431,84823,509,00002,273,280
4Aug 2, 2022 08:1863,55746,807,01922,494,0001,022,0002,535,424
5Aug 2, 2022 08:1863,59543,514,18823,530,00002,428,928
6Aug 2, 2022 08:1863,60045,345,25923,532,00002,420,736
7Aug 2, 2022 08:1863,62742,030,20723,542,00002,273,280
8Aug 2, 2022 08:1863,80854,562,25622,583,0001,026,0002,519,040
9Aug 2, 2022 08:1864,04653,108,31422,667,0001,030,0002,535,424
10Aug 2, 2022 08:1866,44183,514,20624,583,16902,256,896
11Aug 2, 2022 08:1866,68776,529,79024,674,18802,277,376
12Aug 2, 2022 08:1867,00480,317,26724,791,61602,269,184