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 22, 2023 21:58mmalczakmmalczakScore: 74,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 21:5873,72749,514,20626,269,0001,010,0002,289,664
2Sep 22, 2023 21:5873,79753,346,97225,283,0002,022,0002,277,376
3Sep 22, 2023 21:5873,86850,688,97926,319,0001,012,0002,289,664
4Sep 22, 2023 21:5873,94354,013,65825,333,0002,026,0002,392,064
5Sep 22, 2023 21:5874,13250,188,59526,414,0001,015,0002,289,664
6Sep 22, 2023 21:5874,40848,362,43226,512,0001,019,0002,527,232
7Sep 22, 2023 21:5874,48951,220,16626,541,0001,020,0002,289,664
8Sep 22, 2023 21:5874,55754,749,15726,565,0001,021,0002,273,280
9Sep 22, 2023 21:5874,56853,420,02226,569,0001,021,0002,289,664
10Sep 22, 2023 21:5876,35099,002,96128,249,45902,260,992
11Sep 22, 2023 21:5876,44385,635,33028,283,77902,260,992
12Sep 22, 2023 21:5877,459107,798,80528,659,92902,260,992