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 12, 2022 19:25Kenneth MaplesKenneth MaplesScore: 74,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2022 19:2574,18652,277,10226,433,0001,016,0002,490,368
2Oct 12, 2022 19:2574,22449,163,47124,412,0003,051,0002,277,376
3Oct 12, 2022 19:2574,32752,103,53526,483,0001,018,0002,498,560
4Oct 12, 2022 19:2574,37849,185,32426,501,0001,019,0002,506,752
5Oct 12, 2022 19:2574,40852,248,25426,512,0001,019,0002,277,376
6Oct 12, 2022 19:2574,51452,857,74526,549,0001,021,0002,277,376
7Oct 12, 2022 19:2574,57358,343,64326,571,0001,021,0002,277,376
8Oct 12, 2022 19:2574,62454,001,25026,589,0001,022,0002,277,376
9Oct 12, 2022 19:2574,80853,897,63725,702,0001,977,0002,277,376
10Oct 12, 2022 19:2578,801129,980,99729,156,19602,215,936
11Oct 12, 2022 19:2579,06285,891,97329,252,98202,240,512
12Oct 12, 2022 19:2579,44198,689,82229,393,25902,224,128