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 15, 2026 20:43Elijah KinElijah KinScore: 203,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 20:44202,768100,470,84931,010,00044,014,0002,519,040
2Mar 15, 2026 20:43203,092106,487,93334,065,00041,079,0002,519,040
3Mar 15, 2026 20:44203,23298,194,83236,094,00039,102,0002,330,624
4Mar 15, 2026 20:43203,96897,136,18338,237,00037,231,0002,260,992
5Mar 15, 2026 20:44204,335103,742,10434,274,00041,330,0002,519,040
6Mar 15, 2026 20:43204,892100,629,82528,927,00046,883,0002,519,040