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 18, 2023 12:44mmalczakmmalczakScore: 94,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2023 12:4493,45756,636,54833,562,0001,017,0002,277,376
2Sep 18, 2023 12:4494,22264,664,65932,870,0001,992,0002,277,376
3Sep 18, 2023 12:4494,35158,196,17932,916,0001,994,0002,289,664
4Sep 18, 2023 12:4494,48162,753,17632,961,0001,997,0002,289,664
5Sep 18, 2023 12:4494,59556,948,72733,000,0002,000,0002,527,232
6Sep 18, 2023 12:4494,803113,920,38135,077,13502,265,088
7Sep 18, 2023 12:4494,80560,109,39733,074,0002,004,0002,277,376
8Sep 18, 2023 12:4495,212101,869,01635,228,35702,260,992
9Sep 18, 2023 12:4495,23259,994,68433,223,0002,013,0002,289,664
10Sep 18, 2023 12:4495,45160,316,81733,299,0002,018,0002,527,232
11Sep 18, 2023 12:4495,74956,385,55834,415,0001,012,0002,527,232
12Sep 18, 2023 12:4495,906106,274,79335,485,19102,256,896