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:58Oleg KovalovOleg KovalovScore: 237,495Success
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:58237,284121,193,05085,800,0001,995,0002,330,624
2Jan 28, 2025 09:58237,495116,979,14985,876,0001,997,0002,469,888
3Jan 28, 2025 09:58237,824117,473,02184,996,0002,999,0002,478,080