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 listJun 24, 2026 17:57Victor MerckléVictor MerckléScore: 75,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 17:5875,07036,885,58326,662,0001,114,0002,113,536
2Jun 24, 2026 17:5875,14537,163,08626,700,0001,104,0002,113,536
3Jun 24, 2026 17:5875,15638,472,24426,699,0001,109,0002,113,536
4Jun 24, 2026 17:5875,22736,879,09326,754,0001,080,0002,113,536
5Jun 24, 2026 17:5875,27037,001,13726,755,0001,095,0002,113,536
6Jun 24, 2026 17:5875,27836,986,01626,761,0001,092,0002,113,536
7Jun 24, 2026 17:5875,65937,096,71126,893,0001,101,0002,113,536
8Jun 24, 2026 17:5875,73537,183,64126,902,0001,120,0002,113,536
9Jun 24, 2026 17:5875,85937,657,51126,955,0001,113,0002,113,536