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:09Karthik 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:090169,763,108158,481,0002,159,00024,576expected "53689805156977950 ", got "53689805156977950 2 2 268 26405 56 1|109 251 26081 115 260 26101 115 410 26152 112 400 26155 109 398 26167 |159670 "
2Oct 1, 2026 17:090171,805,005160,595,0002,105,00024,576expected "53684069859639139 ", got "53684069859639139 2 2 267 27219 53 1|113 252 26296 119 262 26326 116 411 26388 111 406 26409 109 403 26404 |161669 "
3Oct 1, 2026 17:090171,010,368159,811,0002,113,00024,576expected "53689372597713830 ", got "53689372597713830 2 3 269 26823 56 1|114 251 26252 120 261 26246 115 406 26312 112 403 26324 109 404 26315 |160901 "