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:45Huy Duc LeHuy Duc LeScore: 93,673Success
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:4592,98663,080,13234,405,00002,273,280
2Feb 22, 2024 07:4593,00064,793,18932,386,0002,024,0002,498,560
3Feb 22, 2024 07:4593,05759,417,07331,393,0003,038,0002,506,752
4Feb 22, 2024 07:4593,12464,675,31432,430,0002,026,0002,502,656
5Feb 22, 2024 07:4593,13058,194,33333,445,0001,013,0002,273,280
6Feb 22, 2024 07:4593,62459,568,80933,623,0001,018,0002,330,624
7Feb 22, 2024 07:4593,67361,140,71532,679,0001,980,0002,506,752
8Feb 22, 2024 07:4594,17664,354,99632,854,0001,991,0002,506,752
9Feb 22, 2024 07:4594,19765,238,69832,862,0001,991,0002,506,752
10Feb 22, 2024 07:4597,748116,210,78736,166,87602,244,608
11Feb 22, 2024 07:4598,39594,220,17536,406,05402,301,952
12Feb 22, 2024 07:4598,761110,629,89636,541,48302,297,856