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 listJan 13, 2026 01:14Josu San MartinJosu San MartinScore: 141,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 01:14140,72474,638,92950,066,0002,002,0002,347,008
2Jan 13, 2026 01:14141,36879,097,95251,301,0001,005,0002,342,912
3Jan 13, 2026 01:14142,22782,513,21252,624,00002,277,376