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 06:06NoSIMD_C#NoSIMD_C#Score: 349,827Success
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 06:06349,319155,396,51482,158,00047,090,0002,535,424
2Nov 29, 2024 06:06349,827155,070,63184,284,00045,152,0002,478,080
3Nov 29, 2024 06:06351,657158,053,35485,074,00045,039,0002,535,424