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 19:23Victor MerckléVictor MerckléScore: 73,040Success
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 19:2472,62136,054,32225,675,0001,195,0002,191,360
2Jun 24, 2026 19:2472,94036,212,40325,776,0001,212,0002,191,360
3Jun 24, 2026 19:2472,95437,568,09325,776,0001,217,0002,191,360
4Jun 24, 2026 19:2472,98936,271,79825,790,0001,216,0002,191,360
5Jun 24, 2026 19:2473,04036,163,15325,763,0001,262,0002,191,360
6Jun 24, 2026 19:2473,12436,259,51124,809,0002,247,0002,191,360
7Jun 24, 2026 19:2473,13536,281,48625,838,0001,222,0002,191,360
8Jun 24, 2026 19:2473,19136,303,97424,856,0002,225,0002,191,360
9Jun 24, 2026 19:2473,80236,498,81124,991,0002,316,0002,191,360