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 listMay 26, 2025 06:33E SequeiraE SequeiraScore: 215,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:33205,562106,943,41673,056,0003,002,0002,523,136
2May 26, 2025 06:33215,314110,424,04578,658,0001,008,0002,514,944
3May 26, 2025 06:33227,657105,564,76582,228,0002,005,0002,269,184