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 28, 2023 17:59mmalczakmmalczakScore: 69,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 17:5969,09250,938,59224,542,0001,022,0002,428,928
2Sep 28, 2023 17:5969,17347,698,89125,594,00002,437,120
3Sep 28, 2023 17:5969,19256,761,38025,601,00002,428,928
4Sep 28, 2023 17:5969,29250,392,07125,638,00002,535,424
5Sep 28, 2023 17:5969,32751,692,31025,651,00002,437,120
6Sep 28, 2023 17:5969,43251,760,52225,690,00002,273,280
7Sep 28, 2023 17:5969,44359,901,10825,694,00002,273,280
8Sep 28, 2023 17:5969,82251,875,12024,841,000993,0002,424,832
9Sep 28, 2023 17:5969,89750,596,99823,873,0001,989,0002,273,280
10Sep 28, 2023 17:5972,15491,325,64026,696,82502,281,472
11Sep 28, 2023 17:5972,75465,540,79426,918,79802,289,664
12Sep 28, 2023 17:5972,815104,185,47926,941,56802,277,376