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 17, 2025 00:36Ian MckibbenIan MckibbenScore: 142,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 00:36142,76883,782,00150,831,0001,993,0002,269,184
2Jan 17, 2025 00:36142,78979,653,10251,836,000996,0002,273,280
3Jan 17, 2025 00:36143,25476,356,29452,004,0001,000,0002,289,664