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 12, 2025 19:35caandocaandoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:39Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:39059,341,67147,815,0001,275,0002,113,536expected "53666981839527453 ", got "53676289047173247 "
2Sep 9, 2026 10:39058,735,49147,401,0001,172,0002,113,536expected "53670109680783893 ", got "53680548711370725 "
3Sep 9, 2026 10:391,27720,768,8989,428,0001,176,0002,113,536
4Oct 12, 2025 19:355,96279,867,89549,488,00002,285,568
5Oct 12, 2025 19:355,96771,060,72948,517,0001,010,0002,285,568
6Oct 12, 2025 19:356,04870,363,87848,190,0002,007,0002,285,568