{"raw_statement":[{"iden":"statement","content":"Given two integers (a and b), get their sum:\n\nThere will be one line with two integers given, a and b, separated by spaces.\n\nYou should return the integer sum of a and b, sum. \n\n#cf_span(class=[tex-font-style-underline], body=[Constraints]):\n\n - 1, 000, 000, 000 ≤ a ≤ 1, 000, 000, 000\n\n - 1, 000, 000, 000 ≤ b ≤ 1, 000, 000, 000\n\n - 2, 000, 000, 000 ≤ sum ≤ 2, 000, 000, 000\n\n"},{"iden":"input","content":"There will be one line with two integers given, a and b, separated by spaces."},{"iden":"output","content":"You should return the integer sum of a and b, sum. "},{"iden":"examples","content":"Input5 9Output14Input50 -26Output24"},{"iden":"note","content":"#cf_span(class=[tex-font-style-underline], body=[Constraints]): - 1, 000, 000, 000 ≤ a ≤ 1, 000, 000, 000 - 1, 000, 000, 000 ≤ b ≤ 1, 000, 000, 000 - 2, 000, 000, 000 ≤ sum ≤ 2, 000, 000, 000"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ S \\in \\Sigma^n $ be a string of length $ n $, where $ \\Sigma = \\{a, b, \\dots, z\\} $ is the set of lowercase English letters.\n\n**Constraints**  \n1. $ 1 \\le n \\le 10^7 $  \n2. Each character in $ S $ is in $ \\Sigma $\n\n**Objective**  \nFind the lexicographically smallest permutation of $ S $.","simple_statement":"Sort the characters of the string in lexicographically smallest order.","has_page_source":false}