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 listJul 8, 2021 13:23Yuriy LyfenkoYuriy LyfenkoScore: 72,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 13:2370,161585,586,64025,959,67102,265,088
2Jul 8, 2021 13:2370,324594,918,68126,020,00002,265,088
3Jul 8, 2021 13:2370,652576,317,48326,141,36802,265,088
4Jul 8, 2021 13:2471,029584,758,50726,280,73002,240,512
5Jul 8, 2021 13:2471,068588,127,26226,295,11602,269,184
6Jul 8, 2021 13:2471,321577,182,61126,388,81602,248,704
7Jul 8, 2021 13:2472,849592,779,88526,954,04502,256,896
8Jul 8, 2021 13:2472,932591,665,10726,984,94602,244,608
9Jul 8, 2021 13:2473,416600,561,17627,164,07802,269,184
10Jul 8, 2021 13:23193,511637,035,11471,598,90102,244,608
11Jul 8, 2021 13:23196,082623,714,01272,550,20702,256,896
12Jul 8, 2021 13:23198,218627,412,77173,340,50002,248,704