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 10, 2021 13:55Andrey TsvetkovAndrey TsvetkovScore: 86,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2021 13:5585,10352,922,46430,473,0001,015,0002,428,928
2Sep 10, 2021 13:5585,18656,021,46530,503,0001,016,0002,424,832
3Sep 10, 2021 13:5585,48657,848,44229,590,0002,040,0002,441,216
4Sep 10, 2021 13:5585,50555,384,81030,617,0001,020,0002,433,024
5Sep 10, 2021 13:5585,63261,887,25230,662,0001,022,0002,433,024
6Sep 10, 2021 13:5585,65456,226,17730,670,0001,022,0002,334,720
7Sep 10, 2021 13:5586,15455,890,12730,849,0001,028,0002,420,736
8Sep 10, 2021 13:5586,22759,902,76529,910,0001,994,0002,547,712
9Sep 10, 2021 13:5586,54660,318,87631,022,0001,000,0002,330,624
10Sep 10, 2021 13:5588,48794,147,17432,740,32502,215,936
11Sep 10, 2021 13:5589,27997,386,56533,033,13602,228,224
12Sep 10, 2021 13:5589,700102,833,47433,188,90802,215,936