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:16Sergey StreminSergey StreminScore: 96,924Success
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:1695,77356,618,12334,424,0001,012,0002,318,336
2Sep 11, 2021 07:1695,89258,310,99235,480,00002,514,944
3Sep 11, 2021 07:1696,10858,010,49434,544,0001,016,0002,514,944
4Sep 11, 2021 07:1696,12458,970,63135,566,00002,322,432
5Sep 11, 2021 07:1696,28967,288,71234,610,0001,017,0002,326,528
6Sep 11, 2021 07:1696,89269,540,21833,859,0001,991,0002,330,624
7Sep 11, 2021 07:1696,92465,396,03533,870,0001,992,0002,334,720
8Sep 11, 2021 07:1696,97866,987,68634,886,000996,0002,330,624
9Sep 11, 2021 07:1697,58162,372,94134,100,0002,005,0002,334,720
10Sep 11, 2021 07:16134,136116,055,80149,630,26102,297,856
11Sep 11, 2021 07:16134,144120,046,74349,633,27002,215,936
12Sep 11, 2021 07:16134,612110,947,26249,806,45402,306,048