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 07:50IlyaIlyaScore: 59,210Success
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 07:5358,67531,111,29120,624,0001,086,0002,113,536
2Jun 30, 2026 07:5359,00831,351,77420,651,0001,182,0002,113,536
3Jun 30, 2026 07:5359,10031,414,41320,677,0001,190,0002,113,536
4Jun 30, 2026 07:5359,15131,461,10520,682,0001,204,0002,113,536
5Jun 30, 2026 07:5359,21031,788,86320,727,0001,181,0002,113,536
6Jun 30, 2026 07:5359,21631,417,13020,719,0001,191,0002,117,632
7Jun 30, 2026 07:5359,28931,917,12620,733,0001,204,0002,113,536
8Jun 30, 2026 07:5359,32731,957,37720,719,0001,232,0002,113,536
9Jun 30, 2026 07:5359,64032,052,18820,970,0001,097,0002,113,536