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 listJul 8, 2021 21:57Yurkov AlekseyYurkov AlekseyScore: 106,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 21:57105,30563,818,14036,965,0001,998,0002,289,664
2Jul 8, 2021 21:57105,50562,937,25137,036,0002,001,0002,273,280
3Jul 8, 2021 21:57105,72464,020,08538,115,0001,003,0002,527,232
4Jul 8, 2021 21:57105,73867,371,97537,117,0002,006,0002,289,664
5Jul 8, 2021 21:57105,74660,852,40737,120,0002,006,0002,289,664
6Jul 8, 2021 21:57105,83061,028,42238,153,0001,004,0002,289,664
7Jul 8, 2021 21:57106,39765,259,79038,358,0001,009,0002,289,664
8Jul 8, 2021 21:57107,25169,633,40239,683,00002,289,664
9Jul 8, 2021 21:57107,29567,037,82238,682,0001,017,0002,273,280
10Jul 8, 2021 21:57131,627120,616,42748,702,04302,265,088
11Jul 8, 2021 21:57131,738111,463,76248,743,12902,269,184
12Jul 8, 2021 21:57132,943104,271,77349,188,97402,260,992