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 18:18Sergey StreminSergey StreminScore: 76,297Success
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 18:1875,57853,154,63326,966,000998,0002,494,464
2Sep 11, 2021 18:1875,62453,878,55726,982,000999,0002,281,472
3Sep 11, 2021 18:1875,87354,355,48527,071,0001,002,0002,494,464
4Sep 11, 2021 18:1876,05754,938,30527,136,0001,005,0002,498,560
5Sep 11, 2021 18:1876,14155,900,63527,166,0001,006,0002,281,472
6Sep 11, 2021 18:1876,149102,311,56328,175,16002,203,648
7Sep 11, 2021 18:1876,29751,520,33027,222,0001,008,0002,281,472
8Sep 11, 2021 18:1876,32751,125,36926,224,0002,017,0002,498,560
9Sep 11, 2021 18:1876,33249,067,78527,235,0001,008,0002,281,472
10Sep 11, 2021 18:1876,63551,415,85626,330,0002,025,0002,494,464
11Sep 11, 2021 18:1877,026102,430,58128,499,51402,260,992
12Sep 11, 2021 18:1878,431105,544,49629,019,35802,207,744