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 20, 2026 23:11olliecrowolliecrowScore: 103,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 23:11101,05958,827,25435,371,0002,021,0002,408,448
2Mar 20, 2026 23:11102,25465,536,75535,843,0001,991,0002,326,528
3Mar 20, 2026 23:11102,27366,532,02235,850,0001,991,0002,342,912
4Mar 20, 2026 23:11103,07665,685,15035,128,0003,010,0002,412,544
5Mar 20, 2026 23:11104,64370,419,26336,681,0002,037,0002,338,816
6Mar 20, 2026 23:11108,39262,050,09937,098,0003,007,0002,408,448