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 22:13Dominique GarmierDominique GarmierScore: 2,498,116Success
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 22:132,496,522955,537,622922,714,000999,0002,273,280
2Mar 15, 2026 22:132,498,116953,295,887922,305,0001,998,0002,273,280
3Mar 15, 2026 22:132,500,638949,068,536923,238,0001,998,0002,396,160