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 21, 2026 15:54Josu San MartinJosu San MartinScore: 59,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:5459,60353,826,60520,049,0002,004,0002,445,312
2Mar 21, 2026 15:5459,66848,404,07920,070,0002,007,0002,535,424
3Mar 21, 2026 15:5459,81647,624,94420,120,0002,012,0002,449,408