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 16, 2021 10:11Mikhail ShirokovMikhail ShirokovScore: 119,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2021 10:11119,10567,175,12643,068,0001,001,0002,273,280
2Sep 16, 2021 10:11119,27667,365,12242,126,0002,006,0002,277,376
3Sep 16, 2021 10:11119,33068,878,53442,146,0002,006,0002,265,088
4Sep 16, 2021 10:11119,47067,043,52542,195,0002,009,0002,277,376
5Sep 16, 2021 10:11119,48965,985,49843,207,0001,004,0002,277,376
6Sep 16, 2021 10:11119,51964,172,69641,207,0003,015,0002,273,280
7Sep 16, 2021 10:11119,65970,818,32242,262,0002,012,0002,387,968
8Sep 16, 2021 10:11120,40064,444,45644,548,00002,277,376
9Sep 16, 2021 10:11120,57883,641,47843,601,0001,013,0002,277,376
10Sep 16, 2021 10:11121,393132,646,89644,915,29502,183,168
11Sep 16, 2021 10:11122,212111,428,35745,218,61202,273,280
12Sep 16, 2021 10:11122,404116,242,99045,289,49802,269,184