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 listApr 18, 2026 21:59Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:55Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:550642,213,04033,074,0001,080,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 6, 2026 23:550642,103,16433,050,0001,055,0002,117,632expected "74600294196621100 ", got "20786062482452268 "
3Jul 6, 2026 23:550642,959,94033,689,0001,130,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 18, 2026 21:594,308666,404,65133,767,0001,986,0002,314,240
5Apr 18, 2026 21:594,316654,899,76134,827,000995,0002,314,240
6Apr 18, 2026 21:594,327661,058,15133,915,0001,995,0002,314,240