Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 1, 2026 17:29Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 17:29092,418,13483,340,000020,480expected "53684937952934330 ", got "53684937952934330 2 2 3538 26371 52 1 1156 1053 1051 |26280 26267 |82513 "
2Oct 1, 2026 17:29091,803,60382,839,000020,480expected "53688603438980101 ", got "53688603438980101 3 2 3513 26235 54 1 1150 1048 1045 |26107 26088 |82003 "
3Oct 1, 2026 17:29092,890,13182,812,0001,005,00020,480expected "53689774269917058 ", got "53689774269917058 2 2 3543 26945 51 1 1147 1074 1055 |26213 26206 |82963 "