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 08:57Robert BurkeRobert BurkeScore: 63,359Success
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 08:5763,02749,200,43423,320,00002,281,472
2Aug 2, 2022 08:5763,03246,902,98522,308,0001,014,0002,428,928
3Aug 2, 2022 08:5763,11443,973,10723,352,00002,281,472
4Aug 2, 2022 08:5763,18943,497,07021,347,0002,033,0002,281,472
5Aug 2, 2022 08:5763,32251,651,48423,429,00002,281,472
6Aug 2, 2022 08:5763,34347,203,89022,418,0001,019,0002,433,024
7Aug 2, 2022 08:5763,35945,385,95522,424,0001,019,0002,437,120
8Aug 2, 2022 08:5763,37044,953,47023,447,00002,433,024
9Aug 2, 2022 08:5763,46250,178,44023,481,00002,281,472
10Aug 2, 2022 08:5765,55780,732,41424,255,94502,289,664
11Aug 2, 2022 08:5765,68475,246,10824,303,16702,293,760
12Aug 2, 2022 08:5765,95084,594,59324,401,61902,277,376