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 17, 2026 04:34Josu San MartinJosu San MartinScore: 84,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 04:3484,46558,869,28328,228,0003,024,0002,482,176
2Jan 17, 2026 04:3484,58656,288,90928,269,0003,028,0002,469,888
3Jan 17, 2026 04:3484,61161,183,16228,277,0003,029,0002,322,432
4Jan 17, 2026 04:3484,61157,413,78029,287,0002,019,0002,473,984
5Jan 17, 2026 04:3485,04354,988,66529,436,0002,030,0002,359,296
6Jan 17, 2026 04:3485,38159,169,57329,553,0002,038,0002,543,616