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:31Robert BurkeRobert BurkeScore: 62,530Success
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:3162,41449,582,80722,089,0001,004,0002,514,944
2Aug 2, 2022 08:3162,45150,433,99321,098,0002,009,0002,420,736
3Aug 2, 2022 08:3162,46249,618,73822,107,0001,004,0002,281,472
4Aug 2, 2022 08:3162,48648,458,01422,115,0001,005,0002,424,832
5Aug 2, 2022 08:3162,51651,003,33122,126,0001,005,0002,424,832
6Aug 2, 2022 08:3162,51940,271,79422,127,0001,005,0002,428,928
7Aug 2, 2022 08:3162,53052,569,81521,125,0002,011,0002,428,928
8Aug 2, 2022 08:3162,67345,292,77822,181,0001,008,0002,281,472
9Aug 2, 2022 08:3162,74945,999,54422,208,0001,009,0002,428,928
10Aug 2, 2022 08:3165,60283,035,66024,272,69702,281,472
11Aug 2, 2022 08:3165,64589,419,14624,288,53902,277,376
12Aug 2, 2022 08:3165,82678,771,10924,355,79702,256,896