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 12, 2026 12:15wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:41040,705,03431,492,0001,126,0002,113,536expected "74600294196621100 ", got "74109888271795500 "
2Jul 6, 2026 21:41042,697,32833,551,0001,091,0002,113,536expected "74600294196621100 ", got "73893082066736940 "
3Jul 6, 2026 21:41040,733,65631,551,0001,099,0002,113,536expected "74600294196621100 ", got "74113162872182060 "
4Apr 12, 2026 12:154,22257,858,95433,044,0002,002,0002,277,376
5Apr 12, 2026 12:154,24457,576,66833,212,0002,012,0002,277,376
6Apr 12, 2026 12:154,26061,924,04234,352,0001,010,0002,277,376