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 2, 2026 12:35IlyaIlyaScore: 59,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:3659,46231,970,36120,805,0001,196,0002,113,536
2Jul 2, 2026 12:3659,47232,006,06420,796,0001,209,0002,113,536
3Jul 2, 2026 12:3659,52932,026,68820,775,0001,251,0002,113,536
4Jul 2, 2026 12:3659,59133,485,91920,840,0001,209,0002,113,536
5Jul 2, 2026 12:3659,62931,968,17220,846,0001,217,0002,113,536
6Jul 2, 2026 12:3659,63732,009,98320,856,0001,210,0002,113,536
7Jul 2, 2026 12:3659,73532,025,02320,878,0001,224,0002,113,536
8Jul 2, 2026 12:3659,80232,051,21220,904,0001,223,0002,113,536
9Jul 2, 2026 12:3661,82442,723,41421,593,0001,282,0002,113,536