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 24, 2026 00:40Dominique GarmierDominique GarmierScore: 1,585,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 00:401,584,997625,468,250585,452,000997,0002,273,280
2Mar 24, 2026 00:401,585,122611,205,747584,497,0001,998,0002,531,328
3Mar 24, 2026 00:401,585,168608,110,510584,514,0001,998,0002,473,984