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 20, 2023 20:07mmalczakmmalczakScore: 108,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 20:0785,600104,233,05931,671,89302,252,800
2Sep 20, 2023 20:0785,64699,617,99531,689,16502,273,280
3Sep 20, 2023 20:0787,39796,170,97132,336,83602,269,184
4Sep 20, 2023 20:07102,39766,319,05635,893,0001,994,0002,531,328
5Sep 20, 2023 20:07102,41462,657,89335,899,0001,994,0002,273,280
6Sep 20, 2023 20:07108,11970,730,88439,004,0001,000,0002,289,664
7Sep 20, 2023 20:07108,41463,727,53939,111,0001,002,0002,273,280
8Sep 20, 2023 20:07108,62461,456,94038,182,0002,009,0002,523,136
9Sep 20, 2023 20:07108,67061,489,67638,198,0002,010,0002,277,376
10Sep 20, 2023 20:07109,23562,428,64340,417,00002,289,664
11Sep 20, 2023 20:07109,37065,249,06139,456,0001,011,0002,265,088
12Sep 20, 2023 20:07110,37670,953,20338,847,0001,992,0002,289,664