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 22, 2026 13:41Dominique GarmierDominique GarmierScore: 72,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 13:4172,58953,428,31824,869,0001,989,0002,265,088
2Mar 22, 2026 13:4172,59760,572,46624,872,0001,989,0002,293,760
3Mar 22, 2026 13:4173,05455,905,68025,028,0002,002,0002,293,760