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 13, 2025 23:35Aniruddha DebAniruddha DebScore: 124,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2025 23:35122,98462,031,77445,504,00002,428,928
2Mar 13, 2025 23:35123,41470,513,87745,663,00002,531,328
3Mar 13, 2025 23:35123,47870,075,32045,687,00002,531,328
4Mar 13, 2025 23:35124,00073,907,30044,883,000997,0002,531,328
5Mar 13, 2025 23:35124,27666,241,31143,983,0001,999,0002,510,848
6Mar 13, 2025 23:35124,28167,940,63444,985,000999,0002,424,832
7Mar 13, 2025 23:35124,29265,155,74844,989,000999,0002,502,656
8Mar 13, 2025 23:35124,34167,704,21945,006,0001,000,0002,269,184
9Mar 13, 2025 23:35125,14376,532,53146,303,00002,424,832