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:37Huy Duc LeHuy Duc LeScore: 67,576Success
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:3767,15151,887,56220,871,0003,975,0002,506,752
2Feb 22, 2024 07:3767,16552,849,70922,863,0001,988,0002,510,848
3Feb 22, 2024 07:3767,31951,403,77922,916,0001,992,0002,506,752
4Feb 22, 2024 07:3767,33057,939,67421,923,0002,989,0002,273,280
5Feb 22, 2024 07:3767,53051,930,22923,987,000999,0002,273,280
6Feb 22, 2024 07:3767,56851,773,18823,000,0002,000,0002,506,752
7Feb 22, 2024 07:3767,57656,540,14023,003,0002,000,0002,273,280
8Feb 22, 2024 07:3767,58159,157,02723,005,0002,000,0002,506,752
9Feb 22, 2024 07:3767,68646,637,21623,041,0002,003,0002,510,848
10Feb 22, 2024 07:3771,92099,314,68026,610,39902,256,896
11Feb 22, 2024 07:3771,92592,253,69126,612,17102,256,896
12Feb 22, 2024 07:3772,05896,338,97426,661,58002,260,992