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 4, 2025 12:58NoSIMD_C#NoSIMD_C#Score: 332,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 12:58329,484153,283,38163,952,00057,957,0002,297,856
2Apr 4, 2025 12:58332,854152,242,55474,094,00049,062,0002,297,856
3Apr 4, 2025 12:58336,370147,110,36476,280,00048,177,0002,306,048