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 05:04Robert BurkeRobert BurkeScore: 78,251Success
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 05:0475,31153,823,16326,870,000995,0002,416,640
2Aug 2, 2022 05:0475,58153,771,98125,968,0001,997,0002,420,736
3Aug 2, 2022 05:0475,63052,150,59726,984,000999,0002,535,424
4Aug 2, 2022 05:0475,71146,636,51427,013,0001,000,0002,535,424
5Aug 2, 2022 05:0475,87052,661,56627,070,0001,002,0002,273,280
6Aug 2, 2022 05:0476,09549,876,72027,150,0001,005,0002,273,280
7Aug 2, 2022 05:0478,25154,291,41326,957,0001,996,0002,535,424
8Aug 2, 2022 05:0478,44948,137,05828,026,0001,000,0002,514,944
9Aug 2, 2022 05:0478,53847,897,10527,055,0002,004,0002,535,424
10Aug 2, 2022 05:0480,62095,601,94629,829,28402,269,184
11Aug 2, 2022 05:0480,75995,758,16829,880,65202,273,280
12Aug 2, 2022 05:0481,524108,467,57130,163,97802,273,280