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 listAug 6, 2022 18:38Franek KortaFranek KortaScore: 76,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 18:3876,17857,186,36227,180,0001,006,0002,527,232
2Aug 6, 2022 18:3876,60050,341,92926,318,0002,024,0002,535,424
3Aug 6, 2022 18:3876,62752,826,22827,340,0001,012,0002,281,472
4Aug 6, 2022 18:3876,72450,869,47128,388,00002,281,472
5Aug 6, 2022 18:3876,73047,623,44027,377,0001,013,0002,281,472
6Aug 6, 2022 18:3876,73552,898,68527,378,0001,014,0002,531,328
7Aug 6, 2022 18:3876,73550,746,01525,350,0003,042,0002,281,472
8Aug 6, 2022 18:3876,88151,951,53628,446,00002,281,472
9Aug 6, 2022 18:3876,92748,563,25927,447,0001,016,0002,281,472
10Aug 6, 2022 18:3880,95697,305,33229,953,60702,265,088
11Aug 6, 2022 18:3881,02293,605,72629,978,29702,256,896
12Aug 6, 2022 18:3881,166111,676,11230,031,39302,265,088