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 11, 2026 07:34Danylo MocherniukDanylo MocherniukError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:40054,045,66442,296,0002,039,0002,117,632expected "74600294196621100 ", got "32029493972306220 "stderr
2Jul 7, 2026 02:40047,231,76934,804,0002,096,0002,117,632expected "74600294196621100 ", got "40271827018300764 "stderr
3Jul 7, 2026 02:40047,239,55935,015,0002,013,0002,117,632expected "74600294196621100 ", got "40268697975808604 "stderr
4Apr 11, 2026 07:344,49859,681,70235,313,0002,017,0002,297,856
5Apr 11, 2026 07:344,51659,883,19335,458,0002,026,0002,392,064
6Apr 11, 2026 07:344,58864,421,53235,077,0003,006,0002,469,888
7Apr 11, 2026 07:344,60359,348,52735,192,0003,016,0002,387,968
8Apr 11, 2026 07:344,72266,284,45636,175,0003,014,0002,297,856
9Apr 11, 2026 07:344,73862,017,75638,315,0001,008,0002,400,256