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 11:10Dominique GarmierDominique GarmierScore: 523,195Success
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 11:10522,443221,183,288192,303,0001,001,0002,322,432
2Mar 15, 2026 11:10523,195224,374,125193,582,00002,322,432
3Mar 15, 2026 11:10523,603223,716,831192,735,000998,0002,273,280