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 16, 2025 23:36Ian MckibbenIan MckibbenScore: 16,759,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 23:3616,759,0656,232,455,9726,198,856,0001,998,0002,281,472
2Jan 16, 2025 23:3616,759,6926,224,800,4146,199,087,0001,999,0002,281,472
3Jan 16, 2025 23:3616,765,4496,234,608,4056,201,218,0001,998,0002,281,472