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:37Ian MckibbenIan MckibbenScore: 128,814Success
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:37128,24668,239,13047,451,00002,269,184
2Jan 17, 2025 00:37128,81473,713,54846,647,0001,014,0002,289,664
3Jan 17, 2025 00:37128,86872,856,36146,667,0001,014,0002,289,664