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:34Mikhail ShirokovMikhail ShirokovScore: 109,908Success
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:34108,40366,974,46637,101,0003,008,0002,523,136
2Sep 15, 2021 15:34108,67365,544,73739,204,0001,005,0002,519,040
3Sep 15, 2021 15:34108,79268,130,41038,241,0002,012,0002,523,136
4Sep 15, 2021 15:34109,62466,781,87438,533,0002,028,0002,523,136
5Sep 15, 2021 15:34109,67867,842,73937,538,0003,043,0002,502,656
6Sep 15, 2021 15:34109,79566,100,38840,624,00002,519,040
7Sep 15, 2021 15:34109,90872,477,66240,666,00002,519,040
8Sep 15, 2021 15:34110,92766,619,94940,042,0001,001,0002,519,040
9Sep 15, 2021 15:34111,16266,619,57239,124,0002,006,0002,392,064
10Sep 15, 2021 15:34113,384115,458,98941,951,94002,248,704
11Sep 15, 2021 15:34114,45898,316,56242,349,44102,244,608
12Sep 15, 2021 15:34115,154107,980,67642,607,00502,236,416