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 08:04mmalczakmmalczakScore: 84,500Success
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 08:0483,48455,442,30429,893,000996,0002,277,376
2Sep 19, 2023 08:0483,58958,284,63929,931,000997,0002,289,664
3Sep 19, 2023 08:0483,83056,053,83929,016,0002,001,0002,531,328
4Sep 19, 2023 08:0484,04354,340,21230,093,0001,003,0002,289,664
5Sep 19, 2023 08:0484,08955,584,26029,106,0002,007,0002,289,664
6Sep 19, 2023 08:0484,40053,906,83529,214,0002,014,0002,289,664
7Sep 19, 2023 08:0484,50062,699,03929,248,0002,017,0002,289,664
8Sep 19, 2023 08:0484,56257,885,42029,270,0002,018,0002,269,184
9Sep 19, 2023 08:0484,69757,075,68829,317,0002,021,0002,289,664
10Sep 19, 2023 08:0485,97496,884,34831,810,21902,273,280
11Sep 19, 2023 08:0486,265101,633,97631,918,05302,252,800
12Sep 19, 2023 08:0486,33490,341,92831,943,44802,256,896