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 listNov 29, 2024 03:45NoSIMD_C#NoSIMD_C#Score: 350,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 03:45350,068150,837,39684,342,00045,183,0002,293,760
2Nov 29, 2024 03:45350,243155,260,60284,732,00044,858,0002,535,424
3Nov 29, 2024 03:45353,530157,840,07278,883,00051,923,0002,355,200