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 16:37mmalczakmmalczakScore: 69,819Success
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 16:3769,20857,096,16724,583,0001,024,0002,535,424
2Sep 28, 2023 16:3769,27048,012,23425,630,00002,428,928
3Sep 28, 2023 16:3769,27650,362,35725,632,00002,428,928
4Sep 28, 2023 16:3769,28149,510,84125,634,00002,428,928
5Sep 28, 2023 16:3769,36551,490,18225,665,00002,535,424
6Sep 28, 2023 16:3769,39252,889,21125,675,00002,424,832
7Sep 28, 2023 16:3769,81948,120,46925,833,00002,535,424
8Sep 28, 2023 16:3769,84950,025,42623,856,0001,988,0002,424,832
9Sep 28, 2023 16:3769,92454,383,95524,877,000995,0002,535,424
10Sep 28, 2023 16:3772,04986,368,30326,658,07102,285,568
11Sep 28, 2023 16:3772,11583,050,03026,682,53102,281,472
12Sep 28, 2023 16:3772,54193,081,90626,840,11402,252,800