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 listApr 18, 2025 03:17Chandrasekaran AkashChandrasekaran AkashScore: 60,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 03:2260,47853,198,59522,377,00002,531,328
2Apr 18, 2025 03:1760,48450,583,92221,362,0001,017,0002,269,184
3Apr 18, 2025 03:1760,51649,321,82821,374,0001,017,0002,449,408
4Apr 18, 2025 03:2260,57345,733,54021,394,0001,018,0002,449,408
5Apr 18, 2025 03:1760,65146,286,90422,441,00002,449,408
6Apr 18, 2025 03:1760,69244,795,63121,436,0001,020,0002,445,312
7Apr 18, 2025 03:1760,73541,300,99021,451,0001,021,0002,445,312
8Apr 18, 2025 03:1760,76840,649,13921,462,0001,022,0002,527,232
9Apr 18, 2025 03:1760,78145,634,50822,489,00002,531,328
10Apr 18, 2025 03:2260,82250,220,06622,504,00002,531,328
11Apr 18, 2025 03:1760,85948,290,45622,518,00002,531,328
12Apr 18, 2025 03:1760,93847,824,63421,523,0001,024,0002,445,312