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 00:01Josu San MartinJosu San MartinScore: 109,057Success
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 00:01108,56266,807,77638,160,0002,008,0002,465,792
2Jan 13, 2026 00:01109,05768,253,26138,334,0002,017,0002,465,792
3Jan 13, 2026 00:01109,23267,446,48638,396,0002,020,0002,465,792