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 22, 2025 02:17Ian MckibbenIan MckibbenScore: 70,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 02:1770,79754,770,12625,188,0001,007,0002,437,120
2Jan 22, 2025 02:1770,80349,912,63225,190,0001,007,0002,437,120
3Jan 22, 2025 02:1771,29549,203,77926,379,00002,433,024