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 listFeb 1, 2025 07:30mebowlermebowlerScore: 776,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 07:30775,254306,396,675165,910,000120,934,0002,347,008
2Feb 1, 2025 07:30776,000309,575,823157,066,000130,054,0002,334,720
3Feb 1, 2025 07:30788,408318,471,109173,828,000117,883,0002,342,912