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 08:32NoSIMD_C#NoSIMD_C#Score: 280,586Success
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 08:32279,243126,459,98511,034,00092,286,0002,342,912
2Nov 26, 2024 08:32280,586132,873,05054,903,00048,914,0002,330,624
3Nov 26, 2024 08:32281,427129,298,65939,048,00065,080,0002,359,296