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 13, 2026 22:29olliecrowolliecrowScore: 60,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 22:2960,51443,569,48422,390,00002,273,280
2Mar 13, 2026 22:2960,69743,663,04022,458,00002,510,848
3Mar 13, 2026 22:2960,82745,226,05122,506,00002,273,280