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 09:44Ian MckibbenIan MckibbenScore: 71,057Success
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 09:4470,85446,441,63924,200,0002,016,0002,531,328
2Jan 19, 2025 09:4471,05748,636,92125,280,0001,011,0002,437,120
3Jan 19, 2025 09:4471,30059,130,44526,381,00002,433,024