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 23:24Dominique GarmierDominique GarmierScore: 70,857Success
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 23:2469,96849,647,57323,897,0001,991,0002,404,352
2Mar 15, 2026 23:2470,85756,475,19224,201,0002,016,0002,273,280
3Mar 15, 2026 23:2471,13552,745,18325,308,0001,012,0002,273,280