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:38piculpiculScore: 73,816Success
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:3873,40550,663,97425,149,0002,011,0002,519,040
2Sep 15, 2021 17:3873,50550,648,27325,183,0002,014,0002,527,232
3Sep 15, 2021 17:3873,51149,403,92325,185,0002,014,0002,273,280
4Sep 15, 2021 17:3873,56249,372,20525,202,0002,016,0002,273,280
5Sep 15, 2021 17:3873,58151,119,24525,209,0002,016,0002,519,040
6Sep 15, 2021 17:3873,64158,892,37925,229,0002,018,0002,289,664
7Sep 15, 2021 17:3873,81652,767,78526,301,0001,011,0002,289,664
8Sep 15, 2021 17:3874,04659,733,32927,397,00002,289,664
9Sep 15, 2021 17:3874,08649,987,53425,382,0002,030,0002,289,664
10Sep 15, 2021 17:3875,46091,707,62727,920,24002,265,088
11Sep 15, 2021 17:3875,89095,116,65728,079,19102,252,800
12Sep 15, 2021 17:3876,02187,939,77528,127,76002,252,800