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 listApr 3, 2023 21:27Yurkov AlekseyYurkov AlekseyScore: 97,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:2797,23061,135,53634,976,000999,0002,265,088
2Apr 3, 2023 21:2797,33564,130,62434,014,0002,000,0002,289,664
3Apr 3, 2023 21:2797,41457,777,29035,042,0001,001,0002,289,664
4Apr 3, 2023 21:2797,42256,330,66934,044,0002,002,0002,285,568
5Apr 3, 2023 21:2797,65759,229,80334,126,0002,007,0002,289,664
6Apr 3, 2023 21:2797,75158,603,41834,159,0002,009,0002,277,376
7Apr 3, 2023 21:2797,96257,985,88334,233,0002,013,0002,281,472
8Apr 3, 2023 21:2797,97059,719,57434,236,0002,013,0002,277,376
9Apr 3, 2023 21:2798,25462,533,22934,335,0002,019,0002,289,664
10Apr 3, 2023 21:2799,01499,398,20736,635,17702,265,088
11Apr 3, 2023 21:2799,544105,515,00336,831,16102,260,992
12Apr 3, 2023 21:2799,90192,565,57736,963,32402,277,376