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 15:20limanjun99limanjun99Score: 71,981Success
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 15:2071,36854,064,53325,391,0001,015,0002,289,664
2Mar 19, 2026 15:2071,60054,111,94025,474,0001,018,0002,269,184
3Mar 19, 2026 15:2071,73253,208,78926,541,00002,289,664
4Mar 19, 2026 15:2071,97855,975,13125,608,0001,024,0002,269,184
5Mar 19, 2026 15:2071,98159,017,89825,609,0001,024,0002,269,184
6Mar 19, 2026 15:2072,09557,245,23526,675,00002,289,664
7Mar 19, 2026 15:2072,17852,728,80526,706,00002,273,280
8Mar 19, 2026 15:2072,50856,968,11324,841,0001,987,0002,273,280
9Mar 19, 2026 15:2072,53552,856,64824,850,0001,988,0002,269,184