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 listApr 9, 2025 16:28NoSIMD_C#NoSIMD_C#Score: 576,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 16:28575,757238,788,628190,027,00023,003,0002,293,760
2Apr 9, 2025 16:28576,095239,906,980207,151,0006,004,0002,535,424
3Apr 9, 2025 16:28578,924243,094,054170,161,00044,041,0002,535,424