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 listSep 6, 2026 15:53big blenderbig blenderScore: 1,406,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 15:541,344,024507,308,400447,073,00050,216,0002,113,536
2Sep 6, 2026 15:541,395,729527,410,015467,368,00049,052,0002,113,536
3Sep 6, 2026 15:541,397,800527,305,474467,420,00049,766,0002,113,536
4Sep 6, 2026 15:541,400,445529,088,675468,633,00049,532,0002,113,536
5Sep 6, 2026 15:541,406,778530,669,772470,583,00049,925,0002,113,536
6Sep 6, 2026 15:541,412,294532,566,290472,922,00049,627,0002,113,536
7Sep 6, 2026 15:541,417,618535,449,173475,167,00049,352,0002,113,536
8Sep 6, 2026 15:541,420,843535,830,036475,776,00049,936,0002,113,536
9Sep 6, 2026 15:541,430,413539,337,275480,342,00048,911,0002,113,536