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 07:55Ian MckibbenIan MckibbenScore: 71,384Success
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 07:5571,28151,081,35425,360,0001,014,0002,531,328
2Jan 19, 2025 07:5571,38450,279,06626,412,00002,437,120
3Jan 19, 2025 07:5571,79252,685,60126,563,00002,269,184