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 19:57Kenneth MaplesKenneth MaplesScore: 73,503Success
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 19:5772,94648,652,54224,991,0001,999,0002,281,472
2Oct 13, 2022 19:5773,03855,581,54225,023,0002,001,0002,277,376
3Oct 13, 2022 19:5773,15452,700,60523,057,0004,010,0002,277,376
4Oct 13, 2022 19:5773,17848,290,19724,068,0003,008,0002,490,368
5Oct 13, 2022 19:5773,20348,397,16026,082,0001,003,0002,277,376
6Oct 13, 2022 19:5773,24949,688,97924,091,0003,011,0002,277,376
7Oct 13, 2022 19:5773,50349,818,01226,189,0001,007,0002,277,376
8Oct 13, 2022 19:5773,67848,936,55324,232,0003,029,0002,498,560
9Oct 13, 2022 19:5773,71654,116,76224,245,0003,030,0002,277,376
10Oct 13, 2022 19:5777,538106,161,66028,689,14502,220,032
11Oct 13, 2022 19:5777,99290,439,24228,857,18902,232,320
12Oct 13, 2022 19:5778,187100,777,43928,929,20802,236,416