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 4, 2024 07:32Andrey LikhachevAndrey LikhachevScore: 70,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2024 07:3270,21951,580,56023,983,0001,998,0002,371,584
2Sep 4, 2024 07:3270,27354,035,46124,001,0002,000,0002,375,680
3Sep 4, 2024 07:3270,32753,084,81324,020,0002,001,0002,363,392
4Sep 4, 2024 07:3270,35750,957,91625,031,0001,001,0002,371,584
5Sep 4, 2024 07:3270,57349,936,72125,108,0001,004,0002,285,568
6Sep 4, 2024 07:3270,77652,844,61624,173,0002,014,0002,289,664
7Sep 4, 2024 07:3270,81150,638,09224,185,0002,015,0002,359,296
8Sep 4, 2024 07:3270,86248,796,16124,203,0002,016,0002,379,776
9Sep 4, 2024 07:3270,91149,017,37224,219,0002,018,0002,363,392
10Sep 4, 2024 07:3270,96853,547,63724,239,0002,019,0002,375,680
11Sep 4, 2024 07:3271,37853,853,92025,395,0001,015,0002,371,584
12Sep 4, 2024 07:3271,59554,424,41025,472,0001,018,0002,371,584