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 19, 2023 07:59mmalczakmmalczakScore: 109,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2023 07:59108,73864,331,38939,228,0001,005,0002,289,664
2Sep 19, 2023 07:59108,91166,438,83038,283,0002,014,0002,527,232
3Sep 19, 2023 07:59109,06567,114,45739,346,0001,008,0002,527,232
4Sep 19, 2023 07:59109,10566,087,58738,351,0002,018,0002,289,664
5Sep 19, 2023 07:59109,17067,584,60639,384,0001,009,0002,277,376
6Sep 19, 2023 07:59109,36563,271,35339,454,0001,011,0002,383,872
7Sep 19, 2023 07:59109,94670,521,00340,680,00002,289,664
8Sep 19, 2023 07:59109,97372,164,57840,690,00002,289,664
9Sep 19, 2023 07:59110,06569,241,71640,724,00002,289,664
10Sep 19, 2023 07:59112,052109,851,11841,459,06502,260,992
11Sep 19, 2023 07:59112,526119,190,46141,634,49102,265,088
12Sep 19, 2023 07:59113,131110,229,52841,858,52302,269,184