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 08:23IlyaIlyaScore: 59,413Success
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 08:2659,02431,302,71220,734,0001,105,0002,113,536
2Jul 3, 2026 08:2659,12731,414,08520,772,0001,105,0002,113,536
3Jul 3, 2026 08:2659,21331,361,97620,795,0001,114,0002,113,536
4Jul 3, 2026 08:2659,24531,445,65520,792,0001,129,0002,113,536
5Jul 3, 2026 08:2659,41331,493,21020,870,0001,113,0002,113,536
6Jul 3, 2026 08:2659,41631,548,20920,842,0001,142,0002,113,536
7Jul 3, 2026 08:2659,43731,514,72020,864,0001,128,0002,113,536
8Jul 3, 2026 08:2659,46731,628,15120,835,0001,168,0002,113,536
9Jul 3, 2026 08:2659,48131,548,58920,824,0001,184,0002,113,536