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,489Success
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,38946,243,88619,977,0001,997,0002,449,408
2Mar 21, 2026 15:5459,48946,895,32421,011,0001,000,0002,441,216
3Mar 21, 2026 15:5459,59547,042,41520,046,0002,004,0002,433,024