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 29, 2024 07:20NoSIMD_C#NoSIMD_C#Score: 306,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 07:20304,808141,502,59565,871,00046,908,0002,396,160
2Nov 29, 2024 07:20306,386139,221,81869,222,00044,141,0002,461,696
3Nov 29, 2024 07:20307,289139,367,35664,827,00048,870,0002,359,296