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 29, 2026 21:38Andrew TsibinAndrew TsibinScore: 58,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 21:3858,18131,596,39620,503,0001,024,0002,113,536
2Jul 29, 2026 21:3858,24531,651,32420,520,0001,031,0002,113,536
3Jul 29, 2026 21:3858,32131,814,47920,549,0001,030,0002,113,536
4Jul 29, 2026 21:3858,49731,730,48820,611,0001,033,0002,113,536
5Jul 29, 2026 21:3858,51031,657,29220,547,0001,102,0002,113,536
6Jul 29, 2026 21:3858,58131,723,24520,622,0001,053,0002,113,536
7Jul 29, 2026 21:3859,98333,049,94420,961,0001,233,0004,210,688
8Jul 29, 2026 21:3879,07839,373,46421,255,0008,004,0002,113,536
9Jul 29, 2026 21:38134,41059,778,04620,686,00029,046,00041,959,424