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:10Ian 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 23, 2025 01:1069,39550,028,80725,676,00002,437,120
2Jan 23, 2025 01:1069,87050,929,98324,858,000994,0002,437,120
3Jan 23, 2025 01:1070,03548,109,91025,913,00002,269,184