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 listFeb 17, 2025 09:34Ian MckibbenIan MckibbenScore: 72,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2025 09:3371,95955,502,80926,625,00002,531,328
2Feb 17, 2025 09:3472,03550,677,60426,653,00002,433,024
3Feb 17, 2025 09:3372,07856,256,01325,644,0001,025,0002,433,024
4Feb 17, 2025 09:3472,20051,540,11726,714,00002,433,024
5Feb 17, 2025 09:3372,57651,410,03725,859,000994,0002,510,848
6Feb 17, 2025 09:3472,60354,468,39725,869,000994,0002,433,024