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 listMar 18, 2026 03:34Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:31Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:31045,542,37936,381,0001,242,0002,117,632expected "74600294196621100 ", got "24424476292919084 "
2Jul 7, 2026 03:31045,483,26236,295,0001,197,0002,117,632expected "74600294196621100 ", got "22926978692399136 "
3Jul 7, 2026 03:31045,532,89436,378,0001,230,0002,117,632expected "74600294196621100 ", got "24424476292919084 "
4Mar 18, 2026 03:344,92464,667,46738,873,0001,993,0002,469,888
5Mar 18, 2026 03:344,93866,224,85638,984,0001,999,0002,306,048
6Mar 18, 2026 03:344,94272,605,74239,018,0002,000,0002,269,184