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 25, 2025 00:44Ian MckibbenIan MckibbenScore: 100,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 00:4494,07657,088,74932,819,0001,989,0002,269,184
2Jan 25, 2025 00:44100,72259,220,90336,260,0001,007,0002,433,024
3Jan 25, 2025 00:44105,81466,423,59238,148,0001,003,0002,531,328