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 19, 2026 14:27Dominique GarmierDominique GarmierScore: 71,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 14:2771,06850,195,70224,273,0002,022,0002,273,280
2Mar 15, 2026 22:2871,17050,212,77424,308,0002,025,0002,260,992
3Mar 15, 2026 22:2871,27654,052,87925,358,0001,014,0002,506,752
4Mar 19, 2026 14:2771,34955,311,47825,384,0001,015,0002,273,280
5Mar 15, 2026 22:2871,51950,231,74625,445,0001,017,0002,396,160
6Mar 19, 2026 14:2771,51952,858,78926,462,00002,400,256