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 15, 2026 19:58Elijah KinElijah KinScore: 214,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:58214,724105,382,20837,210,00042,238,0002,318,336
2Mar 15, 2026 19:58214,903101,993,15243,280,00036,234,0002,273,280
3Mar 15, 2026 19:58216,070102,661,43641,972,00037,974,0002,265,088