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 24, 2023 21:21mmalczakmmalczakScore: 72,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:2172,62448,844,01125,838,0001,033,0002,289,664
2Sep 24, 2023 21:2172,64652,557,96624,888,0001,991,0002,269,184
3Sep 24, 2023 21:2172,70849,020,54525,906,000996,0002,285,568
4Sep 24, 2023 21:2172,75752,479,69825,923,000997,0002,289,664
5Sep 24, 2023 21:2172,88151,273,40424,969,0001,997,0002,273,280
6Sep 24, 2023 21:2172,89549,612,34824,974,0001,997,0002,289,664
7Sep 24, 2023 21:2172,91951,699,98224,982,0001,998,0002,289,664
8Sep 24, 2023 21:2173,41656,384,65226,158,0001,006,0002,289,664
9Sep 24, 2023 21:2173,51451,542,71626,193,0001,007,0002,289,664
10Sep 24, 2023 21:2175,697111,321,15428,007,86602,260,992
11Sep 24, 2023 21:2175,941103,240,87428,098,22502,256,896
12Sep 24, 2023 21:2176,00488,275,47028,121,54102,277,376