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 5, 2025 19:13NoSIMD_C#NoSIMD_C#Score: 273,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2025 19:13271,697126,934,97829,153,00071,375,0002,293,760
2Apr 5, 2025 19:13273,786128,888,84652,155,00049,146,0002,445,312
3Apr 5, 2025 19:13275,351131,163,38667,920,00033,960,0002,293,760