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 listJun 30, 2026 18:17IlyaIlyaScore: 59,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:2058,90531,206,43120,705,0001,090,0002,113,536
2Jun 30, 2026 18:2058,91331,219,31420,677,0001,121,0002,113,536
3Jun 30, 2026 18:2058,94531,227,33320,675,0001,135,0002,113,536
4Jun 30, 2026 18:2059,05631,835,60520,660,0001,191,0002,113,536
5Jun 30, 2026 18:2059,05931,769,53120,674,0001,178,0002,113,536
6Jun 30, 2026 18:2059,11331,351,33320,686,0001,186,0002,113,536
7Jun 30, 2026 18:2059,18931,824,51620,689,0001,211,0002,113,536
8Jun 30, 2026 18:2059,20531,875,66920,719,0001,187,0002,113,536
9Jun 30, 2026 18:2059,34031,468,74720,867,0001,089,0002,113,536