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 6, 2022 21:01Franek KortaFranek KortaScore: 74,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 21:0174,06851,645,41526,390,0001,015,0002,269,184
2Aug 6, 2022 21:0174,18153,097,87024,398,0003,049,0002,281,472
3Aug 6, 2022 21:0174,18450,698,75525,415,0002,033,0002,285,568
4Aug 6, 2022 21:0174,25750,688,50725,440,0002,035,0002,281,472
5Aug 6, 2022 21:0174,33853,273,68925,468,0002,037,0002,281,472
6Aug 6, 2022 21:0174,34652,340,52425,471,0002,037,0002,269,184
7Aug 6, 2022 21:0174,35148,527,93125,473,0002,037,0002,269,184
8Aug 6, 2022 21:0174,36256,424,26925,476,0002,038,0002,281,472
9Aug 6, 2022 21:0174,73851,320,13125,678,0001,975,0002,351,104
10Aug 6, 2022 21:0178,37095,852,28828,996,95702,269,184
11Aug 6, 2022 21:0178,39599,437,30529,006,08302,260,992
12Aug 6, 2022 21:0178,65398,655,94629,101,66602,297,856