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 15, 2021 23:30Yurkov AlekseyYurkov AlekseyScore: 165,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 23:30100,161102,405,37137,059,62702,260,992
2Jul 15, 2021 23:30100,258118,603,91637,095,49302,265,088
3Jul 15, 2021 23:30100,64487,561,12437,238,37302,265,088
4Jul 15, 2021 23:30165,04986,074,34759,066,0002,002,0002,396,160
5Jul 15, 2021 23:30165,15184,178,40759,103,0002,003,0002,289,664
6Jul 15, 2021 23:30165,16586,197,17759,108,0002,003,0002,523,136
7Jul 15, 2021 23:30165,17387,739,19159,111,0002,003,0002,379,776
8Jul 15, 2021 23:30165,29588,522,48360,157,0001,002,0002,289,664
9Jul 15, 2021 23:30165,35183,458,51959,175,0002,005,0002,269,184
10Jul 15, 2021 23:30166,07386,183,13660,440,0001,007,0002,289,664
11Jul 15, 2021 23:30166,58491,117,14960,626,0001,010,0002,519,040
12Jul 15, 2021 23:30167,88687,770,03760,115,0002,003,0002,265,088