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 07:57Sergey StreminSergey StreminScore: 98,216Success
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 07:5796,99766,496,40433,896,0001,993,0002,502,656
2Sep 11, 2021 07:5797,34960,560,38234,018,0002,001,0002,494,464
3Sep 11, 2021 07:5797,37063,165,47335,027,0001,000,0002,281,472
4Sep 11, 2021 07:5797,66857,709,63135,134,0001,003,0002,281,472
5Sep 11, 2021 07:5797,81159,273,20935,185,0001,005,0002,498,560
6Sep 11, 2021 07:5798,13258,406,47335,301,0001,008,0002,281,472
7Sep 11, 2021 07:5798,21660,921,27835,331,0001,009,0002,285,568
8Sep 11, 2021 07:5798,747104,273,37936,536,42302,256,896
9Sep 11, 2021 07:5798,880104,679,01136,585,75902,211,840
10Sep 11, 2021 07:5799,619119,513,91536,859,14602,191,360
11Sep 11, 2021 07:5799,64366,095,42035,872,000996,0002,494,464
12Sep 11, 2021 07:5799,81462,731,28134,935,0001,996,0002,281,472