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 14, 2026 22:40wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:54Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:54044,089,55534,257,0001,163,0002,113,536expected "74600294196621100 ", got "73482676387243820 "
2Jul 6, 2026 22:54044,202,31134,421,0001,166,0002,113,536expected "74600294196621100 ", got "73482741179515180 "
3Jul 6, 2026 22:54043,237,55032,024,0001,191,0002,113,536expected "74600294196621100 ", got "68676472321451564 "
4Mar 14, 2026 22:404,26456,402,26534,381,0001,011,0002,273,280
5Mar 14, 2026 22:404,27055,926,14834,431,0001,012,0002,498,560
6Mar 14, 2026 22:404,31259,883,10733,800,0001,988,0002,494,464