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 listJul 3, 2026 22:46Victor MerckléVictor MerckléScore: 79,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 22:4678,77837,123,23929,148,00002,117,632stderr
2Jul 3, 2026 22:4678,87237,139,42529,183,00002,117,632stderr
3Jul 3, 2026 22:4678,87237,162,17029,183,00002,117,632stderr
4Jul 3, 2026 22:4678,92437,271,72728,174,0001,028,0002,117,632stderr
5Jul 3, 2026 22:4679,00537,016,11928,162,0001,070,0002,117,632stderr
6Jul 3, 2026 22:4679,10837,044,58228,199,0001,071,0002,117,632stderr
7Jul 3, 2026 22:4679,26737,727,15328,268,0001,061,0002,117,632stderr
8Jul 3, 2026 22:4679,37837,320,42028,293,0001,077,0002,117,632stderr
9Jul 3, 2026 22:4679,43240,198,78228,308,0001,082,0002,117,632stderr