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 1, 2026 13:41IlyaIlyaScore: 61,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 13:4360,47831,844,02021,259,0001,118,0002,113,536
2Jul 1, 2026 13:4360,90832,083,17321,397,0001,139,0002,113,536
3Jul 1, 2026 13:4360,95432,034,97121,355,0001,198,0002,113,536
4Jul 1, 2026 13:4360,96232,071,48121,368,0001,188,0002,113,536
5Jul 1, 2026 13:4361,09132,606,65921,401,0001,203,0002,113,536
6Jul 1, 2026 13:4321,401,6597,928,515,9447,763,864,000154,750,0002,113,536
7Jul 1, 2026 13:4321,568,5817,990,034,0507,826,203,000154,172,0002,113,536
8Jul 1, 2026 13:4321,588,2817,997,306,8377,833,647,000154,017,0002,113,536
9Jul 1, 2026 13:4321,713,2918,043,785,9787,876,451,000157,467,0002,113,536