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 2, 2022 06:20Robert BurkeRobert BurkeScore: 75,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 06:2074,56854,349,02126,569,0001,021,0002,293,760
2Aug 2, 2022 06:2074,77652,735,06426,679,000988,0002,293,760
3Aug 2, 2022 06:2074,82252,899,14026,659,0001,025,0002,293,760
4Aug 2, 2022 06:2074,82756,667,85226,661,0001,025,0002,510,848
5Aug 2, 2022 06:2074,83561,024,79926,664,0001,025,0002,293,760
6Aug 2, 2022 06:2074,85755,180,47526,672,0001,025,0002,527,232
7Aug 2, 2022 06:2075,28149,500,55225,865,0001,989,0002,379,776
8Aug 2, 2022 06:2075,28153,652,72126,860,000994,0002,523,136
9Aug 2, 2022 06:2075,28961,848,77626,863,000994,0002,523,136
10Aug 2, 2022 06:2079,815107,336,88229,531,45302,265,088
11Aug 2, 2022 06:2079,830102,743,34629,537,02002,256,896
12Aug 2, 2022 06:2080,84193,392,18329,911,05902,256,896