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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:10042,345,75433,163,0001,105,0002,113,536expected "74600294196621100 ", got "74101129636750636 "
2Jul 6, 2026 22:10042,580,81833,315,0001,096,0002,113,536expected "74600294196621100 ", got "74095791239231020 "
3Jul 6, 2026 22:10040,446,77331,543,0001,059,0002,113,536expected "74600294196621100 ", got "74097364087043884 "
4Apr 13, 2026 10:394,11958,862,79332,180,0002,011,0002,277,376
5Apr 13, 2026 10:394,24856,491,66233,245,0002,014,0002,494,464
6Apr 13, 2026 10:394,27356,027,56234,457,0001,013,0002,531,328