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 08:20wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:06036,907,75627,984,0001,006,0002,113,536expected "74600294196621100 ", got "74924921883142028 "
2Jul 6, 2026 17:06036,799,08227,765,0001,025,0002,113,536expected "74600294196621100 ", got "74924735763143128 "
3Jul 6, 2026 17:06038,315,86229,537,0001,015,0002,113,536expected "74600294196621100 ", got "74594483532788277 "
4Apr 19, 2026 08:203,54752,493,34828,424,0001,015,0002,277,376
5Apr 19, 2026 08:203,56054,341,84528,531,0001,018,0002,494,464
6Apr 19, 2026 08:203,76358,251,56829,215,0002,014,0002,531,328