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 03:00Huy Duc LeHuy Duc LeScore: 89,241Success
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 03:0086,89559,117,22830,142,0002,009,0002,277,376
2Feb 22, 2024 03:0087,01960,533,10830,185,0002,012,0002,510,848
3Feb 22, 2024 03:0088,14359,081,80631,594,0001,019,0002,514,944
4Feb 22, 2024 03:0088,78460,194,93230,860,0001,990,0002,514,944
5Feb 22, 2024 03:0088,80558,023,99730,867,0001,991,0002,277,376
6Feb 22, 2024 03:0088,82465,020,77032,865,00002,277,376
7Feb 22, 2024 03:0089,24156,768,57130,018,0003,001,0002,514,944
8Feb 22, 2024 03:0089,28657,196,14132,035,0001,001,0002,514,944
9Feb 22, 2024 03:0089,44659,907,14632,093,0001,002,0002,523,136
10Feb 22, 2024 03:0090,17098,018,46333,363,05102,252,800
11Feb 22, 2024 03:0090,77095,428,42633,584,90902,265,088
12Feb 22, 2024 03:0091,03595,211,60133,682,90102,252,800