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 25, 2025 00:45Ian MckibbenIan MckibbenScore: 69,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 00:4569,46850,898,28925,703,00002,437,120
2Jan 25, 2025 00:4569,87052,699,12724,858,000994,0002,428,928
3Jan 25, 2025 00:4570,06853,850,54924,928,000997,0002,531,328