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 17:54Sergey StreminSergey StreminScore: 71,854Success
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 17:5470,88449,118,45324,210,0002,017,0002,490,368
2Sep 11, 2021 17:5471,01147,356,77725,264,0001,010,0002,494,464
3Sep 11, 2021 17:5471,33048,778,37326,392,00002,498,560
4Sep 11, 2021 17:5471,34649,069,69424,368,0002,030,0002,498,560
5Sep 11, 2021 17:5471,38649,288,43125,398,0001,015,0002,494,464
6Sep 11, 2021 17:5471,52250,245,44625,446,0001,017,0002,359,296
7Sep 11, 2021 17:5471,85457,895,42125,564,0001,022,0002,285,568
8Sep 11, 2021 17:5471,95152,475,65725,599,0001,023,0002,330,624
9Sep 11, 2021 17:5472,08156,650,43725,645,0001,025,0002,281,472
10Sep 11, 2021 17:5474,11293,458,80827,421,35502,207,744
11Sep 11, 2021 17:5474,23895,702,06427,468,09602,207,744
12Sep 11, 2021 17:5475,699103,640,51228,008,64802,191,360