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 10, 2026 14:36MMisMMisScore: 590,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 14:36584,168242,914,03337,024,000179,118,0002,502,656
2Feb 10, 2026 14:36590,524247,024,00635,916,000182,578,0002,289,664
3Feb 10, 2026 14:36598,181248,740,25036,053,000185,274,0002,289,664