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:19Robert BurkeRobert BurkeScore: 63,649Success
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:1963,29546,151,23323,419,00002,433,024
2Aug 2, 2022 08:1963,39546,963,27023,456,00002,535,424
3Aug 2, 2022 08:1963,41943,111,01023,465,00002,535,424
4Aug 2, 2022 08:1963,51650,264,43523,501,00002,273,280
5Aug 2, 2022 08:1963,52749,965,75023,505,00002,535,424
6Aug 2, 2022 08:1963,60047,130,34423,532,00002,535,424
7Aug 2, 2022 08:1963,64947,001,04223,550,00002,535,424
8Aug 2, 2022 08:1963,74649,813,29623,586,00002,273,280
9Aug 2, 2022 08:1964,09248,547,84323,714,00002,535,424
10Aug 2, 2022 08:1966,46984,480,80624,593,48502,265,088
11Aug 2, 2022 08:1966,67692,880,52924,670,27002,281,472
12Aug 2, 2022 08:1967,50976,486,68024,978,33502,273,280