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 22:09Elijah KinElijah KinScore: 146,032Success
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 22:09145,00081,222,90223,282,00030,368,0002,285,568
2Mar 15, 2026 22:09145,45182,489,14213,952,00039,865,0002,478,080
3Mar 15, 2026 22:09145,91177,057,0099,997,00043,990,0002,473,984
4Mar 15, 2026 22:09145,91976,493,2969,998,00043,992,0002,285,568
5Mar 15, 2026 22:09146,03281,222,6429,005,00045,027,0002,469,888
6Mar 15, 2026 22:09146,07081,268,81013,011,00041,035,0002,285,568
7Mar 15, 2026 22:09147,35773,819,9988,077,00046,445,0002,285,568
8Mar 15, 2026 22:09149,51975,727,5826,035,00049,287,0002,285,568
9Mar 15, 2026 22:09149,71977,995,5218,057,00047,339,0002,465,792