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 22, 2025 01:45Ian MckibbenIan MckibbenScore: 83,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 01:4583,33859,061,07928,846,0001,989,0002,269,184
2Jan 22, 2025 01:4583,43062,348,00229,874,000995,0002,531,328
3Jan 22, 2025 01:4584,13053,794,23030,124,0001,004,0002,510,848