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 28, 2026 09:40Shikhar SoniShikhar SoniScore: 75,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:4174,79137,143,55426,632,0001,041,0002,113,536
2Jun 28, 2026 09:4175,22137,623,50626,788,0001,044,0002,113,536
3Jun 28, 2026 09:4175,33537,760,59226,832,0001,042,0002,113,536