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 17:44piculpiculScore: 73,124Success
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 17:4472,68148,544,52824,900,0001,992,0002,519,040
2Sep 15, 2021 17:4472,69249,079,48124,904,0001,992,0002,289,664
3Sep 15, 2021 17:4472,80056,864,86825,939,000997,0002,289,664
4Sep 15, 2021 17:4472,88953,664,75224,972,0001,997,0002,289,664
5Sep 15, 2021 17:4472,94659,781,28825,991,000999,0002,265,088
6Sep 15, 2021 17:4472,95750,151,09424,995,0001,999,0002,519,040
7Sep 15, 2021 17:4473,12447,300,23125,052,0002,004,0002,510,848
8Sep 15, 2021 17:4473,16854,610,53825,067,0002,005,0002,265,088
9Sep 15, 2021 17:4473,27347,070,83025,103,0002,008,0002,519,040
10Sep 15, 2021 17:4484,11698,146,80831,122,78702,260,992
11Sep 15, 2021 17:4484,232101,879,00031,165,74902,252,800
12Sep 15, 2021 17:4493,271106,149,17934,510,26002,260,992