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 listMar 26, 2023 11:23Yurkov AlekseyYurkov AlekseyScore: 98,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 11:2397,32764,173,91834,011,0002,000,0002,289,664
2Mar 26, 2023 11:2397,69763,339,04835,144,0001,004,0002,289,664
3Mar 26, 2023 11:2397,92461,750,90535,226,0001,006,0002,289,664
4Mar 26, 2023 11:2398,29265,241,15334,348,0002,020,0002,277,376
5Mar 26, 2023 11:2398,44960,606,50735,415,0001,011,0002,289,664
6Mar 26, 2023 11:2398,45158,521,12034,404,0002,023,0002,383,872
7Mar 26, 2023 11:2398,65460,143,65235,489,0001,013,0002,281,472
8Mar 26, 2023 11:2398,71957,704,58835,512,0001,014,0002,289,664
9Mar 26, 2023 11:2399,52465,223,74234,834,0001,990,0002,289,664
10Mar 26, 2023 11:2399,573102,411,53536,842,07202,273,280
11Mar 26, 2023 11:23100,04591,635,83737,016,75502,256,896
12Mar 26, 2023 11:23100,44999,650,67837,165,98302,273,280