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 listJul 13, 2021 16:52Andrey TsvetkovAndrey TsvetkovScore: 95,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 16:5294,59761,155,07633,001,0002,000,0002,527,232
2Jul 13, 2021 16:5294,66560,764,88432,024,0003,002,0002,314,240
3Jul 13, 2021 16:5294,69264,882,35332,033,0003,003,0002,527,232
4Jul 13, 2021 16:5294,80361,092,69532,071,0003,006,0002,531,328
5Jul 13, 2021 16:5294,80862,269,34632,073,0003,006,0002,531,328
6Jul 13, 2021 16:5294,83558,722,21032,082,0003,007,0002,527,232
7Jul 13, 2021 16:5295,14955,188,43132,188,0003,017,0002,396,160
8Jul 13, 2021 16:5295,19759,095,27333,211,0002,012,0002,523,136
9Jul 13, 2021 16:5295,44958,434,75432,289,0003,027,0002,527,232
10Jul 13, 2021 16:5297,886101,840,97936,217,91802,207,744
11Jul 13, 2021 16:5298,15199,923,91336,315,72602,203,648
12Jul 13, 2021 16:5298,577106,972,96036,473,43202,195,456