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 listOct 13, 2022 20:02Kenneth MaplesKenneth MaplesScore: 73,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2022 20:0273,17654,241,66524,067,0003,008,0002,277,376
2Oct 13, 2022 20:0273,26548,582,80524,096,0003,012,0002,277,376
3Oct 13, 2022 20:0273,29748,698,78423,103,0004,017,0002,277,376
4Oct 13, 2022 20:0273,31955,180,10125,119,0002,009,0002,494,464
5Oct 13, 2022 20:0273,36548,459,83525,135,0002,010,0002,359,296
6Oct 13, 2022 20:0273,44348,641,08226,168,0001,006,0002,498,560
7Oct 13, 2022 20:0273,45449,658,84825,165,0002,013,0002,490,368
8Oct 13, 2022 20:0273,62451,090,75323,206,0004,035,0002,277,376
9Oct 13, 2022 20:0273,81449,808,56425,288,0002,023,0002,494,464
10Oct 13, 2022 20:0277,46990,408,08428,663,51502,224,128
11Oct 13, 2022 20:0277,983106,666,99928,853,60602,232,320
12Oct 13, 2022 20:0278,05594,273,32328,880,42302,293,760