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 listMar 16, 2026 22:30izotoffizotoffScore: 124,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:30123,85775,989,85445,827,00002,396,160
2Mar 16, 2026 22:30124,01669,545,41242,894,0002,992,0002,498,560
3Mar 16, 2026 22:30124,08473,697,78743,915,0001,996,0002,392,064