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 listJul 3, 2026 12:32A_ShamanA_ShamanScore: 70,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 12:3569,88335,743,79124,759,0001,098,0002,113,536
2Jul 3, 2026 12:3570,04835,450,54624,803,0001,115,0002,113,536
3Jul 3, 2026 12:3570,08335,435,90724,755,0001,176,0002,113,536
4Jul 3, 2026 12:3570,11835,908,11824,745,0001,199,0002,113,536
5Jul 3, 2026 12:3570,14835,952,44824,764,0001,191,0002,113,536
6Jul 3, 2026 12:3570,18635,975,61624,755,0001,214,0002,113,536
7Jul 3, 2026 12:3570,27035,708,85624,805,0001,195,0002,113,536
8Jul 3, 2026 12:3570,29736,025,72524,780,0001,230,0002,113,536
9Jul 3, 2026 12:3570,44836,033,03624,885,0001,181,0002,113,536