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:51NoSIMD_C#NoSIMD_C#Score: 607,965Success
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:51607,119254,215,347188,693,00035,941,0002,293,760
2Apr 9, 2025 16:51607,965256,544,843188,956,00035,991,0002,482,176
3Apr 9, 2025 16:51610,200252,619,899188,811,00036,963,0002,490,368