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 19, 2025 09:22Ian MckibbenIan MckibbenScore: 70,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:2270,58952,314,69524,109,0002,009,0002,531,328
2Jan 19, 2025 09:2270,78449,345,74025,183,0001,007,0002,531,328
3Jan 19, 2025 09:2271,44145,918,64826,433,00002,531,328