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 listMar 17, 2026 15:20wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:24043,341,79634,077,0001,071,0002,113,536expected "74600294196621100 ", got "73603770729791532 "
2Jul 6, 2026 23:24043,276,81833,970,0001,151,0002,113,536expected "74600294196621100 ", got "73598713986742060 "
3Jul 6, 2026 23:24040,741,09331,554,0001,069,0002,113,536expected "74600294196621100 ", got "73530924763938860 "
4Mar 17, 2026 15:204,27957,967,54534,498,0001,014,0002,486,272
5Mar 17, 2026 15:204,28363,789,21734,537,0001,015,0002,494,464
6Mar 17, 2026 15:204,34559,904,49834,064,0002,003,0002,273,280