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:55Ian MckibbenIan MckibbenError
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:5400000Error: expected "429496523060 ", got "429496528812 "stderr
2Jan 25, 2025 00:5573,69251,499,68425,247,0002,019,0002,531,328
3Jan 25, 2025 00:5573,97054,783,75126,356,0001,013,0002,428,928
4Jan 25, 2025 00:5574,29549,962,48027,489,00002,510,848