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 24, 2026 19:01Kevin HeaveyKevin HeaveyScore: 53,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:0453,81328,665,68919,911,000020,480
2Sep 24, 2026 19:0453,82128,661,46919,914,000020,480
3Sep 24, 2026 19:0453,85428,709,41719,926,000020,480
4Sep 24, 2026 19:0453,94828,729,86319,961,000020,480
5Sep 24, 2026 19:0453,95928,786,99519,965,000020,480
6Sep 24, 2026 19:0453,96428,738,12819,967,000020,480
7Sep 24, 2026 19:0454,07828,825,79420,009,000020,480
8Sep 24, 2026 19:0454,13228,915,91920,029,000020,480
9Sep 24, 2026 19:0454,19428,861,69520,052,000020,480