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 23, 2024 15:53NoSIMD_C#NoSIMD_C#Score: 568,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 15:53567,178240,582,018164,887,00044,969,0002,514,944
2Nov 23, 2024 15:53568,086239,962,431167,153,00043,039,0002,527,232
3Nov 23, 2024 15:53568,357239,846,754165,230,00045,062,0002,519,040