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 23:52Dominique GarmierDominique GarmierScore: 73,111Success
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 23:5270,19551,420,63123,975,0001,997,0002,400,256
2Mar 15, 2026 23:5273,11151,884,61126,050,0001,001,0002,400,256
3Mar 15, 2026 23:5274,04957,385,82125,369,0002,029,0002,400,256