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 21:09IlyaIlyaScore: 58,986Success
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 21:1158,70831,160,02220,629,0001,093,0002,113,536
2Jun 30, 2026 21:1158,81831,266,25420,601,0001,162,0002,113,536
3Jun 30, 2026 21:1158,87531,315,27620,671,0001,113,0002,113,536
4Jun 30, 2026 21:1158,88631,214,81420,654,0001,134,0002,113,536
5Jun 30, 2026 21:1158,98631,254,33320,705,0001,120,0002,113,536
6Jun 30, 2026 21:1159,08631,264,00820,701,0001,161,0002,113,536
7Jun 30, 2026 21:1159,16231,401,12920,710,0001,180,0002,113,536
8Jun 30, 2026 21:1159,25931,858,34220,713,0001,213,0002,113,536
9Jun 30, 2026 21:1159,40531,938,12120,775,0001,205,0002,113,536