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 15, 2021 20:07piculpiculScore: 72,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 20:0771,84948,355,37525,562,0001,022,0002,265,088
2Sep 15, 2021 20:0771,84948,899,08725,562,0001,022,0002,273,280
3Sep 15, 2021 20:0771,91452,791,25725,585,0001,023,0002,273,280
4Sep 15, 2021 20:0772,01951,744,71025,623,0001,024,0002,289,664
5Sep 15, 2021 20:0772,03557,775,57625,628,0001,025,0002,531,328
6Sep 15, 2021 20:0772,04355,805,09326,656,00002,289,664
7Sep 15, 2021 20:0772,55951,510,65024,859,0001,988,0002,293,760
8Sep 15, 2021 20:0772,55957,278,49325,853,000994,0002,289,664
9Sep 15, 2021 20:0772,57851,738,74324,865,0001,989,0002,273,280
10Sep 15, 2021 20:0775,148101,592,54027,804,87102,265,088
11Sep 15, 2021 20:0775,67096,889,34327,997,96602,256,896
12Sep 15, 2021 20:0775,90594,907,40528,084,88002,277,376