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 25, 2026 07:34Victor MerckléVictor MerckléScore: 57,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 07:3556,89428,682,69021,051,00002,113,536
2Jun 25, 2026 07:3557,02928,976,75520,093,0001,008,0002,113,536
3Jun 25, 2026 07:3557,03528,930,98420,064,0001,039,0002,113,536
4Jun 25, 2026 07:3557,04828,551,97820,104,0001,004,0002,113,536
5Jun 25, 2026 07:3557,11628,620,34220,114,0001,019,0002,113,536
6Jun 25, 2026 07:3557,12428,791,49920,130,0001,006,0002,113,536
7Jun 25, 2026 07:3557,22728,570,21621,174,00002,113,536
8Jun 25, 2026 07:3557,26228,836,99220,161,0001,026,0002,113,536
9Jun 25, 2026 07:3557,29429,071,84620,153,0001,046,0002,113,536