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:16Mikhail ShirokovMikhail ShirokovScore: 106,911Success
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:16105,21468,655,83536,933,0001,996,0002,519,040
2Sep 16, 2021 10:16105,36261,337,26137,985,000999,0002,519,040
3Sep 16, 2021 10:16105,57067,978,94938,060,0001,001,0002,519,040
4Sep 16, 2021 10:16105,76563,731,60437,127,0002,006,0002,523,136
5Sep 16, 2021 10:16106,27665,618,86537,306,0002,016,0002,383,872
6Sep 16, 2021 10:16106,68663,253,85738,462,0001,012,0002,392,064
7Sep 16, 2021 10:16106,91166,525,09738,543,0001,014,0002,519,040
8Sep 16, 2021 10:16107,07371,191,97539,617,00002,519,040
9Sep 16, 2021 10:16107,16864,112,37538,636,0001,016,0002,523,136
10Sep 16, 2021 10:16107,914113,368,81539,928,01502,199,552
11Sep 16, 2021 10:16109,753107,046,33440,608,68902,256,896
12Sep 16, 2021 10:16110,539106,131,49040,899,34502,199,552