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 28, 2025 09:18mebowlermebowlerScore: 275,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:18274,741127,859,37359,382,00042,272,0002,330,624
2Jan 28, 2025 09:18275,497127,065,77050,967,00050,967,0002,330,624
3Jan 28, 2025 09:18276,138127,215,47963,106,00039,065,0002,330,624