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:57Ian MckibbenIan MckibbenScore: 70,222Success
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:5769,94649,578,26223,890,0001,990,0002,428,928
2Jan 25, 2025 00:5770,22254,532,26424,983,000999,0002,531,328
3Jan 25, 2025 00:5770,61152,826,89526,126,00002,420,736