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 30, 2026 07:31Dominique GarmierDominique GarmierScore: 71,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 07:3171,00347,424,07725,261,0001,010,0002,478,080
2Mar 30, 2026 07:3171,51649,569,06125,444,0001,017,0002,289,664
3Mar 30, 2026 07:3172,55161,142,67424,856,0001,988,0002,289,664