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 listAug 3, 2022 18:34Franek KortaFranek KortaScore: 109,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 18:34107,95466,511,65237,946,0001,997,0002,523,136
2Aug 3, 2022 18:34108,68662,965,45638,204,0002,010,0002,527,232
3Aug 3, 2022 18:34109,03263,663,72638,325,0002,017,0002,523,136
4Aug 3, 2022 18:34109,24963,026,46239,412,0001,010,0002,273,280
5Aug 3, 2022 18:34109,36560,678,72339,454,0001,011,0002,379,776
6Aug 3, 2022 18:34109,36564,959,15138,442,0002,023,0002,273,280
7Aug 3, 2022 18:34109,45765,165,51639,487,0001,012,0002,269,184
8Aug 3, 2022 18:34109,52465,271,98539,511,0001,013,0002,285,568
9Aug 3, 2022 18:34109,71466,785,61138,565,0002,029,0002,527,232
10Aug 3, 2022 18:34111,227129,825,09741,154,15602,256,896
11Aug 3, 2022 18:34111,38998,282,01241,213,82202,269,184
12Aug 3, 2022 18:34112,019117,634,93841,447,16202,260,992