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:54Yuriy LyfenkoYuriy LyfenkoScore: 61,549Success
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:5461,251547,510,38921,633,0001,030,0002,281,472
2Sep 15, 2021 17:5461,362549,753,59020,730,0001,974,0002,281,472
3Sep 15, 2021 17:5461,497549,639,16121,765,000989,0002,289,664
4Sep 15, 2021 17:5461,535553,719,62420,789,0001,979,0002,289,664
5Sep 15, 2021 17:5461,535553,703,89321,779,000989,0002,277,376
6Sep 15, 2021 17:5461,546550,129,89420,792,0001,980,0002,289,664
7Sep 15, 2021 17:5461,549555,951,90020,793,0001,980,0002,289,664
8Sep 15, 2021 17:5461,576551,365,40522,783,00002,289,664
9Sep 15, 2021 17:5461,581546,620,85120,804,0001,981,0002,281,472
10Sep 15, 2021 17:5464,262586,847,19023,776,86002,252,800
11Sep 15, 2021 17:5464,431575,717,84623,839,59802,265,088
12Sep 15, 2021 17:5464,524604,907,45823,874,03702,248,704