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 19, 2026 07:45wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:46038,647,38329,382,0001,043,0002,113,536expected "74600294196621100 ", got "74924796812404464 "
2Jul 6, 2026 17:46036,669,25327,703,0001,051,0002,113,536expected "74600294196621100 ", got "74924789888540464 "
3Jul 6, 2026 17:46037,686,84228,758,0001,047,0002,113,536expected "74600294196621100 ", got "74924787163224464 "
4Apr 19, 2026 07:453,71456,927,28128,841,0001,989,0002,494,464
5Apr 19, 2026 07:453,73256,845,94628,978,0001,998,0002,531,328
6Apr 19, 2026 07:453,75652,174,39129,160,0002,011,0002,277,376