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:20Ian MckibbenIan MckibbenScore: 71,181Success
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:2070,96849,412,32925,249,0001,009,0002,428,928
2Jan 19, 2025 09:2071,18152,849,53126,337,00002,531,328
3Jan 19, 2025 09:2071,45949,078,51826,440,00002,428,928