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:20Robert BurkeRobert BurkeScore: 63,678Success
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:2063,24649,379,38223,401,00002,531,328
2Aug 2, 2022 08:2063,37855,048,70523,450,00002,269,184
3Aug 2, 2022 08:2063,44647,079,45222,455,0001,020,0002,273,280
4Aug 2, 2022 08:2063,48945,785,50923,491,00002,514,944
5Aug 2, 2022 08:2063,54950,750,44023,513,00002,531,328
6Aug 2, 2022 08:2063,63049,901,88223,543,00002,531,328
7Aug 2, 2022 08:2063,67844,850,15523,561,00002,531,328
8Aug 2, 2022 08:2063,68446,482,99223,563,00002,433,024
9Aug 2, 2022 08:2063,72246,075,00623,577,00002,269,184
10Aug 2, 2022 08:2066,47391,003,29524,595,13602,252,800
11Aug 2, 2022 08:2066,75883,581,99024,700,38602,273,280
12Aug 2, 2022 08:2066,81582,111,08424,721,51402,281,472