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 04:03Huy Duc LeHuy Duc LeScore: 72,681Success
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 04:0372,21657,479,45723,637,0003,083,0002,273,280
2Feb 22, 2024 04:0372,24157,186,92624,673,0002,056,0002,519,040
3Feb 22, 2024 04:0372,53252,919,40625,805,0001,032,0002,510,848
4Feb 22, 2024 04:0372,58658,837,09825,863,000994,0002,506,752
5Feb 22, 2024 04:0372,59756,720,24223,877,0002,984,0002,273,280
6Feb 22, 2024 04:0372,60854,485,71424,875,0001,990,0002,523,136
7Feb 22, 2024 04:0372,68151,349,54825,896,000996,0002,514,944
8Feb 22, 2024 04:0372,81953,550,70224,948,0001,995,0002,273,280
9Feb 22, 2024 04:0373,00358,265,67323,010,0004,001,0002,519,040
10Feb 22, 2024 04:0376,742112,988,22928,394,57902,248,704
11Feb 22, 2024 04:0377,13388,480,05128,539,16902,252,800
12Feb 22, 2024 04:0377,19690,997,67228,562,57202,252,800