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:01mebowlermebowlerScore: 275,365Success
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:01274,305128,469,14051,249,00050,244,0002,330,624
2Jan 28, 2025 09:01275,365132,655,56458,934,00042,951,0002,396,160
3Jan 28, 2025 09:01276,484129,133,00858,170,00044,129,0002,400,256