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:16Aniruddha DebAniruddha DebScore: 69,130Success
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:1668,78646,110,37525,451,00002,510,848
2Mar 15, 2025 12:1668,88648,497,06525,488,00002,531,328
3Mar 15, 2025 12:1669,01444,007,62825,535,00002,531,328
4Mar 15, 2025 12:1669,04646,481,74825,547,00002,428,928
5Mar 15, 2025 12:1669,13053,965,93725,578,00002,531,328
6Mar 15, 2025 12:1669,17351,835,88825,594,00002,269,184
7Mar 15, 2025 12:1669,42754,928,53425,688,00002,531,328
8Mar 15, 2025 12:1669,82253,753,84824,841,000993,0002,531,328
9Mar 15, 2025 12:1669,88647,914,81224,864,000994,0002,510,848