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 12:43wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:05040,321,01631,222,0001,103,0002,113,536expected "74600294196621100 ", got "74095082995777836 "
2Jul 6, 2026 21:05039,560,95430,578,0001,094,0002,113,536expected "74600294196621100 ", got "74095000427262252 "
3Jul 6, 2026 21:05037,697,22428,540,0001,094,0002,113,536expected "74600294196621100 ", got "72980520698466092 "
4Apr 13, 2026 12:434,09158,529,85331,960,0001,997,0002,498,560
5Apr 13, 2026 12:434,19561,303,67132,828,0001,989,0002,277,376
6Apr 13, 2026 12:435,10370,544,41241,351,0001,008,0002,494,464