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 listFeb 11, 2026 06:23MMisMMisScore: 597,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 06:23587,719241,728,39933,915,000183,541,0002,281,472
2Feb 11, 2026 06:23597,122240,877,51735,989,000184,946,0002,289,664
3Feb 11, 2026 06:23600,022244,914,91139,001,000183,007,0002,273,280