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 14:04Alex KentAlex KentScore: 504,114Success
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 14:04497,954215,629,05645,059,000139,184,0002,301,952
2Feb 11, 2026 14:04504,114214,588,40643,887,000142,635,0002,334,720
3Feb 11, 2026 14:04505,562211,885,60843,013,000144,045,0002,428,928