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 listApr 9, 2023 17:06Franek KortaFranek KortaScore: 81,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 17:0679,41148,544,77926,343,0003,039,0002,445,312
2Apr 9, 2023 17:0680,11952,336,67129,644,00002,531,328
3Apr 9, 2023 17:0680,79251,977,13428,897,000996,0002,531,328
4Apr 9, 2023 17:0680,98654,249,73828,967,000998,0002,531,328
5Apr 9, 2023 17:0681,15156,266,03728,025,0002,001,0002,531,328
6Apr 9, 2023 17:0681,21451,165,97029,048,0001,001,0002,445,312
7Apr 9, 2023 17:0681,90550,217,33528,285,0002,020,0002,437,120
8Apr 9, 2023 17:0682,69753,630,95230,598,00002,531,328
9Apr 9, 2023 17:0682,77055,475,33530,625,00002,441,216
10Apr 9, 2023 17:0688,26995,066,34132,659,64702,260,992
11Apr 9, 2023 17:0688,377105,095,89332,699,35002,297,856
12Apr 9, 2023 17:0691,60586,303,70633,893,78702,293,760