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:42Aniruddha DebAniruddha DebScore: 124,178Success
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:42123,35772,625,87145,642,00002,428,928
2Mar 13, 2025 23:42123,60877,308,83845,735,00002,269,184
3Mar 13, 2025 23:42123,98668,176,19743,881,0001,994,0002,510,848
4Mar 13, 2025 23:42124,14371,377,23343,936,0001,997,0002,269,184
5Mar 13, 2025 23:42124,17868,160,54044,948,000998,0002,531,328
6Mar 13, 2025 23:42124,23566,831,14544,968,000999,0002,531,328
7Mar 13, 2025 23:42124,45967,066,95445,049,0001,001,0002,424,832
8Mar 13, 2025 23:42124,49567,212,92645,062,0001,001,0002,433,024
9Mar 13, 2025 23:42124,64373,346,64344,113,0002,005,0002,269,184