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 listSep 15, 2021 15:35Mikhail ShirokovMikhail ShirokovScore: 109,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 15:35108,16567,235,02938,020,0002,001,0002,519,040
2Sep 15, 2021 15:35108,50868,204,44138,141,0002,007,0002,396,160
3Sep 15, 2021 15:35108,75967,564,53138,229,0002,012,0002,519,040
4Sep 15, 2021 15:35108,80569,022,67439,252,0001,006,0002,387,968
5Sep 15, 2021 15:35109,31164,256,22338,423,0002,022,0002,392,064
6Sep 15, 2021 15:35109,57361,847,81638,515,0002,027,0002,392,064
7Sep 15, 2021 15:35109,89265,745,89538,627,0002,033,0002,392,064
8Sep 15, 2021 15:35109,91966,511,94340,670,00002,519,040
9Sep 15, 2021 15:35109,96579,057,36839,670,0001,017,0002,383,872
10Sep 15, 2021 15:35111,477111,579,82941,246,53502,256,896
11Sep 15, 2021 15:35111,554110,171,01441,275,08702,256,896
12Sep 15, 2021 15:35112,590115,617,37841,658,19202,252,800