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 28, 2024 09:31NoSIMD_C#NoSIMD_C#Score: 278,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 09:31277,084128,197,37446,235,00056,286,0002,326,528
2Nov 28, 2024 09:31278,589129,028,66354,041,00049,037,0002,330,624
3Nov 28, 2024 09:31279,138131,251,89954,147,00049,134,0002,535,424