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 07:38mmalczakmmalczakScore: 83,911Success
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 07:3882,52252,562,76029,516,0001,017,0002,289,664
2Sep 19, 2023 07:3882,61658,999,53329,550,0001,018,0002,273,280
3Sep 19, 2023 07:3882,76856,481,01329,604,0001,020,0002,531,328
4Sep 19, 2023 07:3882,80559,644,88430,638,00002,289,664
5Sep 19, 2023 07:3883,19255,451,88529,789,000992,0002,273,280
6Sep 19, 2023 07:3883,55454,474,80829,918,000997,0002,277,376
7Sep 19, 2023 07:3883,91157,953,22030,046,0001,001,0002,379,776
8Sep 19, 2023 07:3884,42252,766,13329,221,0002,015,0002,375,680
9Sep 19, 2023 07:3884,85954,058,61529,373,0002,025,0002,289,664
10Sep 19, 2023 07:3885,47994,343,37331,627,30802,277,376
11Sep 19, 2023 07:3885,51699,709,49431,641,05102,256,896
12Sep 19, 2023 07:3886,17090,162,76331,882,93602,269,184