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 16, 2023 12:04mmalczakmmalczakScore: 99,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 12:0497,02463,100,22733,905,0001,994,0002,289,664
2Sep 16, 2023 12:0497,60359,772,49834,107,0002,006,0002,269,184
3Sep 16, 2023 12:0498,03061,911,13634,256,0002,015,0002,289,664
4Sep 16, 2023 12:0498,35457,978,85634,370,0002,021,0002,273,280
5Sep 16, 2023 12:0498,57361,771,36735,459,0001,013,0002,289,664
6Sep 16, 2023 12:0498,96873,037,96835,601,0001,017,0002,531,328
7Sep 16, 2023 12:0499,06264,060,75936,653,00002,273,280
8Sep 16, 2023 12:0499,61669,495,39835,862,000996,0002,289,664
9Sep 16, 2023 12:0499,669118,850,01436,877,68202,256,896
10Sep 16, 2023 12:0499,680123,447,70036,881,58002,269,184
11Sep 16, 2023 12:04100,549107,959,45537,203,16002,260,992
12Sep 16, 2023 12:04104,20363,202,22037,541,0001,014,0002,289,664