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 listAug 28, 2023 20:25Franek KortaFranek KortaScore: 93,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:2592,58655,884,73633,250,0001,007,0002,514,944
2Aug 28, 2023 20:2592,62255,706,58333,263,0001,007,0002,514,944
3Aug 28, 2023 20:2592,63556,939,81833,267,0001,008,0002,514,944
4Aug 28, 2023 20:2592,82260,092,34433,334,0001,010,0002,428,928
5Aug 28, 2023 20:2592,83561,782,34634,349,00002,519,040
6Aug 28, 2023 20:2593,41156,464,28934,562,00002,523,136
7Aug 28, 2023 20:2593,55758,579,92434,616,00002,514,944
8Aug 28, 2023 20:2593,58962,109,31034,628,00002,514,944
9Aug 28, 2023 20:2593,61661,635,12233,620,0001,018,0002,514,944
10Aug 28, 2023 20:25100,458111,044,94637,169,45202,215,936
11Aug 28, 2023 20:25101,770107,014,89137,654,74202,281,472
12Aug 28, 2023 20:25102,51698,769,06937,930,85002,281,472