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 24, 2022 20:27Kenneth MaplesKenneth MaplesScore: 73,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2022 20:2773,13849,440,34521,048,0006,013,0002,494,464
2Oct 24, 2022 20:2773,20550,410,22725,080,0002,006,0002,498,560
3Oct 24, 2022 20:2773,29553,000,65024,106,0003,013,0002,494,464
4Oct 24, 2022 20:2773,34648,763,88725,128,0002,010,0002,502,656
5Oct 24, 2022 20:2773,35149,403,06124,125,0003,015,0002,277,376
6Oct 24, 2022 20:2773,40549,866,95124,143,0003,017,0002,342,912
7Oct 24, 2022 20:2773,66257,465,91024,227,0003,028,0002,277,376
8Oct 24, 2022 20:2773,72749,849,05624,248,0003,031,0002,277,376
9Oct 24, 2022 20:2773,84153,670,34625,298,0002,023,0002,277,376
10Oct 24, 2022 20:2777,68795,739,47828,744,04802,220,032
11Oct 24, 2022 20:2777,96796,180,30828,847,68902,215,936
12Oct 24, 2022 20:2778,619100,321,56129,089,18402,224,128