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 listNov 10, 2025 14:49izotoffizotoffScore: 120,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 14:49119,74162,569,51843,298,0001,006,0002,318,336
2Nov 10, 2025 14:49119,87365,933,96342,337,0002,016,0002,465,792
3Nov 10, 2025 14:49119,97864,916,13042,375,0002,017,0002,326,528
4Nov 10, 2025 14:49120,16565,394,21043,451,0001,010,0002,465,792
5Nov 10, 2025 14:49120,48670,397,14043,567,0001,013,0002,314,240
6Nov 10, 2025 14:49120,53072,343,38742,569,0002,027,0002,318,336
7Nov 10, 2025 14:49120,60371,383,35744,623,00002,322,432
8Nov 10, 2025 14:49121,14369,599,72744,823,00002,465,792
9Nov 10, 2025 14:49121,28975,777,10342,883,0001,994,0002,318,336