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:42Huy Duc LeHuy Duc LeScore: 93,173Success
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:4292,04659,677,65130,051,0004,006,0002,281,472
2Feb 22, 2024 02:4292,06562,340,85633,063,0001,001,0002,514,944
3Feb 22, 2024 02:4292,20859,693,72431,107,0003,010,0002,269,184
4Feb 22, 2024 02:4292,23561,901,20431,116,0003,011,0002,281,472
5Feb 22, 2024 02:4292,76556,120,38432,304,0002,019,0002,281,472
6Feb 22, 2024 02:4292,88157,948,24532,345,0002,021,0002,523,136
7Feb 22, 2024 02:4293,17356,690,88733,461,0001,013,0002,269,184
8Feb 22, 2024 02:4293,30867,901,72132,494,0002,030,0002,535,424
9Feb 22, 2024 02:4293,69766,936,81033,649,0001,019,0002,281,472
10Feb 22, 2024 02:4297,05590,028,60435,910,18002,273,280
11Feb 22, 2024 02:4297,402103,560,40036,038,82102,265,088
12Feb 22, 2024 02:4297,997116,084,11536,258,92602,260,992