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:38Huy Duc LeHuy Duc LeScore: 68,235Success
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:3867,78959,653,38223,076,0002,006,0002,273,280
2Feb 22, 2024 07:3867,81950,812,08923,086,0002,007,0002,494,464
3Feb 22, 2024 07:3868,00053,317,30623,148,0002,012,0002,273,280
4Feb 22, 2024 07:3868,04350,969,40923,162,0002,014,0002,273,280
5Feb 22, 2024 07:3868,07851,697,84422,167,0003,022,0002,277,376
6Feb 22, 2024 07:3868,20548,699,47022,208,0003,028,0002,506,752
7Feb 22, 2024 07:3868,23548,697,05423,228,0002,019,0002,347,008
8Feb 22, 2024 07:3868,30052,489,11423,250,0002,021,0002,273,280
9Feb 22, 2024 07:3868,38650,891,48422,267,0003,036,0002,273,280
10Feb 22, 2024 07:3872,30991,184,06726,754,23602,244,608
11Feb 22, 2024 07:3872,65089,819,00426,880,44802,256,896
12Feb 22, 2024 07:3873,09792,297,58327,045,94902,256,896