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 06:38wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:09Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:09039,909,41731,045,0001,003,0002,113,536expected "74600294196621100 ", got "74833085906244973 "
2Jul 6, 2026 18:09039,986,96830,977,0001,045,0002,113,536expected "74600294196621100 ", got "74833082915199073 "
3Jul 6, 2026 18:09039,578,18330,739,0001,044,0002,113,536expected "74600294196621100 ", got "74833056706417918 "
4Apr 19, 2026 06:383,83656,032,07829,852,0001,990,0002,498,560
5Apr 19, 2026 06:383,83852,610,41430,860,000995,0002,269,184
6Apr 19, 2026 06:383,86255,501,18530,051,0002,003,0002,494,464