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 07:59Huy Duc LeHuy Duc LeScore: 68,746Success
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 07:5968,29746,812,30723,249,0002,021,0002,510,848
2Feb 22, 2024 07:5968,36248,868,13423,271,0002,023,0002,273,280
3Feb 22, 2024 07:5968,44951,419,31722,287,0003,039,0002,510,848
4Feb 22, 2024 07:5968,63049,032,16023,362,0002,031,0002,273,280
5Feb 22, 2024 07:5968,67352,768,20122,360,0003,049,0002,273,280
6Feb 22, 2024 07:5968,69249,576,11423,383,0002,033,0002,506,752
7Feb 22, 2024 07:5968,74648,838,12024,419,0001,017,0002,273,280
8Feb 22, 2024 07:5968,86253,065,55923,441,0002,038,0002,506,752
9Feb 22, 2024 07:5968,92748,348,10325,503,00002,273,280
10Feb 22, 2024 07:5972,74689,724,19026,916,16502,248,704
11Feb 22, 2024 07:5972,82396,154,63626,944,66002,248,704
12Feb 22, 2024 07:5974,06889,394,09327,405,01802,260,992