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 listJan 19, 2025 07:25Ian MckibbenIan MckibbenScore: 75,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 07:2575,32753,907,83226,876,000995,0002,428,928
2Jan 19, 2025 07:2575,40547,549,62026,904,000996,0002,269,184
3Jan 19, 2025 07:2575,78149,349,10827,038,0001,001,0002,531,328