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 listMar 13, 2026 21:48olliecrowolliecrowScore: 60,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 21:4859,77649,219,73921,112,0001,005,0002,273,280
2Mar 13, 2026 21:4860,01450,099,88521,196,0001,009,0002,273,280
3Mar 13, 2026 21:4860,18446,791,59420,244,0002,024,0002,387,968
4Mar 13, 2026 21:4860,33543,851,09920,295,0002,029,0002,396,160
5Mar 13, 2026 21:4860,36246,708,76221,319,0001,015,0002,396,160
6Mar 13, 2026 21:4860,42451,341,35521,341,0001,016,0002,396,160
7Mar 13, 2026 21:4860,76851,879,62721,462,0001,022,0002,404,352
8Mar 13, 2026 21:4861,05150,660,66121,563,0001,026,0002,273,280
9Mar 13, 2026 21:4861,08947,818,50922,603,00002,273,280