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 24, 2023 21:12mmalczakmmalczakScore: 75,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:1274,14650,496,30926,418,0001,016,0002,519,040
2Sep 24, 2023 21:1274,29550,329,14926,471,0001,018,0002,289,664
3Sep 24, 2023 21:1274,73857,847,83927,653,00002,289,664
4Sep 24, 2023 21:1274,80556,297,14126,653,0001,025,0002,273,280
5Sep 24, 2023 21:1274,82255,878,33226,659,0001,025,0002,289,664
6Sep 24, 2023 21:1275,22752,652,07026,840,000994,0002,269,184
7Sep 24, 2023 21:1275,25161,490,03227,843,00002,277,376
8Sep 24, 2023 21:1275,27353,857,84125,862,0001,989,0002,273,280
9Sep 24, 2023 21:1275,53850,019,10126,951,000998,0002,265,088
10Sep 24, 2023 21:1277,55191,648,77128,693,72002,265,088
11Sep 24, 2023 21:1278,255104,257,84128,954,23402,273,280
12Sep 24, 2023 21:1279,204104,931,15329,305,36002,269,184