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 26, 2024 07:33NoSIMD_C#NoSIMD_C#Score: 283,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 07:33282,151127,246,99157,217,00047,179,0002,539,520
2Nov 26, 2024 07:33283,227135,802,96957,886,00046,908,0002,514,944
3Nov 26, 2024 07:33284,189134,234,79558,083,00047,067,0002,519,040