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:03IlyaIlyaScore: 59,951Success
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:0559,73731,503,97921,017,0001,086,0002,113,536
2Jun 30, 2026 21:0559,84531,626,14421,044,0001,099,0002,113,536
3Jun 30, 2026 21:0559,91031,609,42221,071,0001,096,0002,113,536
4Jun 30, 2026 21:0559,94531,643,57621,036,0001,144,0002,113,536
5Jun 30, 2026 21:0559,95131,645,07821,076,0001,106,0002,113,536
6Jun 30, 2026 21:0560,13231,704,54321,137,0001,112,0002,113,536
7Jun 30, 2026 21:0560,40531,933,48921,128,0001,222,0002,113,536
8Jun 30, 2026 21:0560,42132,289,15821,161,0001,195,0002,113,536
9Jun 30, 2026 21:0560,74332,055,08221,446,0001,029,0002,113,536