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 19:31Dominique GarmierDominique GarmierScore: 70,562Success
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 19:3170,53257,666,90025,094,0001,003,0002,281,472
2Mar 24, 2026 19:3170,56252,079,38125,104,0001,004,0002,400,256
3Mar 24, 2026 19:3171,15154,151,67224,301,0002,025,0002,482,176