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:47NoSIMD_C#NoSIMD_C#Score: 283,692Success
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:47283,205132,379,39455,886,00048,900,0002,412,544
2Nov 26, 2024 07:47283,692139,207,31755,982,00048,984,0002,539,520
3Nov 26, 2024 07:47284,732130,174,98961,204,00044,147,0002,482,176