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:41Ian MckibbenIan MckibbenScore: 70,597Success
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:4170,50048,864,38425,082,0001,003,0002,437,120
2Jan 25, 2025 00:4170,59749,315,38625,117,0001,004,0002,269,184
3Jan 25, 2025 00:4170,99745,753,09124,249,0002,020,0002,531,328