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 listFeb 22, 2024 02:31Huy Duc LeHuy Duc LeScore: 93,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 02:3192,03257,280,37433,051,0001,001,0002,281,472
2Feb 22, 2024 02:3192,20559,039,13132,110,0002,006,0002,281,472
3Feb 22, 2024 02:3192,47854,786,66232,205,0002,012,0002,277,376
4Feb 22, 2024 02:3192,82457,328,17632,325,0002,020,0002,527,232
5Feb 22, 2024 02:3192,88467,189,66933,357,0001,010,0002,285,568
6Feb 22, 2024 02:3193,27358,206,52531,466,0003,045,0002,285,568
7Feb 22, 2024 02:3193,44365,454,53730,507,0004,067,0002,527,232
8Feb 22, 2024 02:3194,12264,187,71632,835,0001,990,0002,281,472
9Feb 22, 2024 02:3194,32761,758,22632,907,0001,994,0002,281,472
10Feb 22, 2024 02:3197,092106,519,03535,923,91802,269,184
11Feb 22, 2024 02:3197,169100,665,79635,952,46202,273,280
12Feb 22, 2024 02:3197,399103,078,46336,037,74602,265,088