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 15, 2025 12:11Aniruddha DebAniruddha DebScore: 70,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2025 12:1170,32447,646,60025,020,0001,000,0002,531,328
2Mar 15, 2025 12:1170,46847,115,59125,071,0001,002,0002,531,328
3Mar 15, 2025 12:1170,51152,552,06425,086,0001,003,0002,428,928
4Mar 15, 2025 12:1170,51647,808,92925,088,0001,003,0002,531,328
5Mar 15, 2025 12:1170,79553,546,98025,187,0001,007,0002,531,328
6Mar 15, 2025 12:1170,95445,895,49824,234,0002,019,0002,510,848
7Mar 15, 2025 12:1171,13247,068,32325,307,0001,012,0002,269,184
8Mar 15, 2025 12:1171,31148,277,84926,385,00002,531,328
9Mar 15, 2025 12:1171,32753,636,18526,391,00002,531,328