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 listMar 20, 2026 21:19Josu San MartinJosu San MartinScore: 67,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 21:1967,54357,393,77523,992,000999,0002,281,472
2Mar 20, 2026 21:1967,68451,160,75823,040,0002,003,0002,289,664
3Mar 20, 2026 21:1967,74648,590,78924,064,0001,002,0002,527,232
4Mar 20, 2026 21:1967,79250,459,88123,077,0002,006,0002,383,872
5Mar 20, 2026 21:1967,89253,219,95724,116,0001,004,0002,289,664
6Mar 20, 2026 21:1968,28449,357,94123,244,0002,021,0002,273,280
7Mar 20, 2026 21:1968,28947,853,35423,246,0002,021,0002,289,664
8Mar 20, 2026 21:1972,18650,335,01123,742,0002,967,0002,531,328
9Mar 20, 2026 21:1974,43257,549,04025,573,0001,967,0002,273,280