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 08:55mebowlermebowlerScore: 284,476Success
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 08:55283,986132,607,49757,041,00048,034,0002,330,624
2Jan 28, 2025 08:55284,476130,362,67350,122,00055,134,0002,457,600
3Jan 28, 2025 08:55290,068128,854,91055,167,00052,158,0002,457,600