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 20, 2023 19:31mmalczakmmalczakScore: 104,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 19:31103,94664,500,13936,436,0002,024,0002,289,664
2Sep 20, 2023 19:31104,12266,721,09137,512,0001,013,0002,281,472
3Sep 20, 2023 19:31104,46269,699,24937,634,0001,017,0002,277,376
4Sep 20, 2023 19:31104,55767,015,71337,668,0001,018,0002,289,664
5Sep 20, 2023 19:31104,93068,001,91036,833,0001,991,0002,273,280
6Sep 20, 2023 19:31104,96568,601,18936,846,0001,991,0002,273,280
7Sep 20, 2023 19:31104,98969,179,32636,854,0001,992,0002,289,664
8Sep 20, 2023 19:31105,18962,031,74736,925,0001,995,0002,289,664
9Sep 20, 2023 19:31105,30362,124,86237,963,000999,0002,527,232
10Sep 20, 2023 19:31106,145115,323,62239,273,60202,265,088
11Sep 20, 2023 19:31106,637109,242,10939,455,70502,256,896
12Sep 20, 2023 19:31106,710102,274,43339,482,86302,256,896