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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:13Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:13050,663,71533,937,0001,056,0002,113,536expected "74600294196621100 ", got "73663944146597932 "
2Jul 6, 2026 21:13051,062,58533,481,0001,033,0002,113,536expected "74600294196621100 ", got "74093846290336300 "
3Jul 6, 2026 21:13038,817,08829,795,0001,079,0002,113,536expected "74600294196621100 ", got "72389745307849004 "
4Apr 13, 2026 11:434,19756,884,79132,849,0001,990,0002,277,376
5Apr 13, 2026 11:434,20955,862,32732,938,0001,996,0002,498,560
6Apr 13, 2026 11:434,75465,306,92338,449,0001,011,0002,277,376