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 listMar 26, 2023 11:19Yurkov AlekseyYurkov AlekseyScore: 116,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 11:1999,212106,682,28536,708,49402,281,472
2Mar 26, 2023 11:1999,44096,390,92936,792,88902,256,896
3Mar 26, 2023 11:19100,113118,225,64837,041,62702,256,896
4Mar 26, 2023 11:19116,31669,783,24142,037,0001,000,0002,289,664
5Mar 26, 2023 11:19116,55970,834,66741,122,0002,005,0002,273,280
6Mar 26, 2023 11:19116,74171,772,30741,185,0002,009,0002,289,664
7Mar 26, 2023 11:19116,81968,851,52341,213,0002,010,0002,273,280
8Mar 26, 2023 11:19117,33866,611,30741,396,0002,019,0002,273,280
9Mar 26, 2023 11:19117,48671,520,82342,460,0001,010,0002,269,184
10Mar 26, 2023 11:19117,52271,435,95142,472,0001,011,0002,289,664
11Mar 26, 2023 11:19117,69566,916,29142,535,0001,012,0002,289,664
12Mar 26, 2023 11:19117,82272,420,77943,594,00002,289,664