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:44Ian MckibbenIan MckibbenScore: 78,419Success
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:4478,24650,876,39527,953,000998,0002,428,928
2Jan 19, 2025 07:4478,41954,512,96928,015,0001,000,0002,531,328
3Jan 19, 2025 07:4478,84154,269,34527,160,0002,011,0002,428,928