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 23, 2025 01:09Ian MckibbenIan MckibbenScore: 69,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 01:0969,36247,567,21824,638,0001,026,0002,428,928
2Jan 23, 2025 01:0969,88950,059,41823,870,0001,989,0002,531,328
3Jan 23, 2025 01:0970,09747,454,35125,936,00002,433,024