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 listMay 26, 2025 06:36E SequeiraE SequeiraScore: 265,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:38259,330128,993,67293,953,0001,999,0002,285,568
2May 26, 2025 06:38263,408122,405,48897,461,00002,285,568
3May 26, 2025 06:36263,522123,810,27697,503,00002,265,088
4May 26, 2025 06:36265,265126,335,54896,145,0002,003,0002,269,184
5May 26, 2025 06:36266,251119,594,30297,508,0001,005,0002,285,568
6May 26, 2025 06:38267,830122,381,05097,096,0002,001,0002,285,568