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 18, 2023 07:11mmalczakmmalczakScore: 84,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2023 07:1183,43055,970,60129,874,000995,0002,289,664
2Sep 18, 2023 07:1183,68660,737,83828,967,0001,997,0002,277,376
3Sep 18, 2023 07:1183,80052,662,48030,006,0001,000,0002,289,664
4Sep 18, 2023 07:1183,80352,373,99229,007,0002,000,0002,289,664
5Sep 18, 2023 07:1183,84154,504,06729,020,0002,001,0002,289,664
6Sep 18, 2023 07:1183,92453,934,65929,049,0002,003,0002,273,280
7Sep 18, 2023 07:1184,30353,893,10429,180,0002,012,0002,289,664
8Sep 18, 2023 07:1184,59754,325,56129,282,0002,019,0002,273,280
9Sep 18, 2023 07:1185,36850,695,09830,568,0001,018,0002,269,184
10Sep 18, 2023 07:1185,907101,167,67031,785,51202,269,184
11Sep 18, 2023 07:1186,30598,658,68131,932,71602,269,184
12Sep 18, 2023 07:1186,636110,784,11532,055,18302,260,992