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 13, 2026 11:10wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:46037,795,10528,884,0001,071,0002,113,536expected "74600294196621100 ", got "72407834513898796 "
2Jul 6, 2026 20:46037,126,91128,247,0001,087,0002,113,536expected "74600294196621100 ", got "72474314099401260 "
3Jul 6, 2026 20:46037,121,89527,999,0001,112,0002,113,536expected "74600294196621100 ", got "72400715488027692 "
4Apr 13, 2026 11:104,07562,079,89231,835,0001,989,0002,277,376
5Apr 13, 2026 11:104,16364,333,45733,539,0001,016,0002,490,368
6Apr 13, 2026 11:104,19562,610,42632,831,0001,989,0002,277,376