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 listSep 15, 2021 15:30Mikhail ShirokovMikhail ShirokovScore: 109,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 15:30108,34662,380,76238,084,0002,004,0002,523,136
2Sep 15, 2021 15:30108,52767,101,16338,148,0002,007,0002,383,872
3Sep 15, 2021 15:30108,94665,209,41636,279,0004,031,0002,519,040
4Sep 15, 2021 15:30108,96862,253,68540,318,00002,379,776
5Sep 15, 2021 15:30109,24364,740,02439,410,0001,010,0002,519,040
6Sep 15, 2021 15:30109,61164,272,82540,556,00002,498,560
7Sep 15, 2021 15:30109,62463,197,17639,547,0001,014,0002,392,064
8Sep 15, 2021 15:30109,86874,318,47739,635,0001,016,0002,519,040
9Sep 15, 2021 15:30120,06866,745,38043,416,0001,009,0002,519,040
10Sep 15, 2021 15:30130,258114,784,41548,195,61502,244,608
11Sep 15, 2021 15:30130,317125,748,98248,217,40202,232,320
12Sep 15, 2021 15:30130,939112,481,24348,447,40302,236,416