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 14, 2026 08:40wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:41037,679,25328,382,0001,156,0002,113,536expected "74600294196621100 ", got "72264576516684588 "
2Jul 6, 2026 18:41041,435,22231,854,0001,132,0002,113,536expected "74600294196621100 ", got "74102853472724268 "
3Jul 6, 2026 18:41037,420,46528,467,0001,121,0002,113,536expected "74600294196621100 ", got "72495258901568300 "
4Apr 14, 2026 08:404,03565,713,22232,475,0001,014,0002,502,656
5Apr 14, 2026 08:404,04856,932,54532,583,0001,018,0002,486,272
6Apr 14, 2026 08:404,21158,914,77332,951,0001,997,0002,490,368