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 11, 2021 18:33Sergey StreminSergey StreminScore: 71,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 18:3370,84948,614,52524,198,0002,016,0002,494,464
2Sep 11, 2021 18:3371,04956,105,88624,266,0002,022,0002,506,752
3Sep 11, 2021 18:3371,09247,201,80325,293,0001,011,0002,281,472
4Sep 11, 2021 18:3371,15454,676,93725,315,0001,012,0002,277,376
5Sep 11, 2021 18:3371,16847,364,20925,320,0001,012,0002,502,656
6Sep 11, 2021 18:3371,25752,493,77324,337,0002,028,0002,498,560
7Sep 11, 2021 18:3371,57352,055,05925,464,0001,018,0002,281,472
8Sep 11, 2021 18:3371,65951,125,35925,495,0001,019,0002,285,568
9Sep 11, 2021 18:3371,74948,443,57425,526,0001,021,0002,494,464
10Sep 11, 2021 18:3373,881107,848,44027,335,99002,199,552
11Sep 11, 2021 18:3374,182100,511,87227,447,23702,199,552
12Sep 11, 2021 18:3375,01298,906,13927,754,54402,203,648