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 12, 2026 04:26Josu San MartinJosu San MartinScore: 82,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:2681,95455,351,30529,313,0001,010,0002,359,296
2Jan 12, 2026 04:2682,17651,378,18230,405,00002,347,008
3Jan 12, 2026 04:2682,62456,186,13030,571,00002,465,792