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 11, 2021 07:21Sergey StreminSergey StreminScore: 96,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 07:2195,90062,857,74135,483,00002,514,944
2Sep 11, 2021 07:2195,97658,819,46934,497,0001,014,0002,514,944
3Sep 11, 2021 07:2196,02761,549,57934,515,0001,015,0002,465,792
4Sep 11, 2021 07:2196,13857,358,39934,555,0001,016,0002,519,040
5Sep 11, 2021 07:2196,27364,953,21734,604,0001,017,0002,473,984
6Sep 11, 2021 07:2196,91164,547,61634,861,000996,0002,514,944
7Sep 11, 2021 07:2196,96564,014,50934,881,000996,0002,461,696
8Sep 11, 2021 07:2196,96861,664,89233,885,0001,993,0002,461,696
9Sep 11, 2021 07:2196,98966,876,20534,890,000996,0002,519,040
10Sep 11, 2021 07:2199,069107,948,45036,655,62702,228,224
11Sep 11, 2021 07:2199,126105,445,19236,676,52802,301,952
12Sep 11, 2021 07:21100,26598,132,15837,097,93502,306,048