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:56Yuriy LyfenkoYuriy LyfenkoScore: 61,489Success
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:5660,935547,149,13721,522,0001,024,0002,281,472
2Sep 15, 2021 17:5661,003551,430,48922,571,00002,281,472
3Sep 15, 2021 17:5661,022552,729,83822,578,00002,289,664
4Sep 15, 2021 17:5661,035549,398,98021,557,0001,026,0002,289,664
5Sep 15, 2021 17:5661,405550,483,81721,733,000987,0002,289,664
6Sep 15, 2021 17:5661,405551,056,29520,745,0001,975,0002,281,472
7Sep 15, 2021 17:5661,489550,616,39620,773,0001,978,0002,281,472
8Sep 15, 2021 17:5661,495552,323,85921,764,000989,0002,281,472
9Sep 15, 2021 17:5661,511553,771,40520,780,0001,979,0002,289,664
10Sep 15, 2021 17:5664,041591,569,79023,695,16002,248,704
11Sep 15, 2021 17:5664,274583,619,65723,781,46402,248,704
12Sep 15, 2021 17:5664,284579,864,09223,785,12102,252,800