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 30, 2026 05:30limanjun99limanjun99Score: 62,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 05:3061,45447,843,49422,738,00002,396,160
2Mar 30, 2026 05:3061,79248,764,25721,869,000994,0002,404,352
3Mar 30, 2026 05:3061,97048,207,67521,933,000996,0002,281,472
4Mar 30, 2026 05:3062,14948,162,84720,996,0001,999,0002,392,064
5Mar 30, 2026 05:3062,26541,316,46021,035,0002,003,0002,510,848
6Mar 30, 2026 05:3062,42446,754,27722,093,0001,004,0002,273,280