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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:42Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:42037,746,91728,627,0001,134,0002,113,536expected "74600294196621100 ", got "72978432701583148 "
2Jul 6, 2026 18:42038,826,11829,886,0001,096,0002,113,536expected "74600294196621100 ", got "72473219584029228 "
3Jul 6, 2026 18:42037,171,14028,220,0001,092,0002,113,536expected "74600294196621100 ", got "72475919964332076 "
4Apr 13, 2026 12:414,05860,173,84031,697,0001,981,0002,502,656
5Apr 13, 2026 12:414,05861,100,64732,662,0001,020,0002,486,272
6Apr 13, 2026 12:414,11562,589,15332,149,0002,009,0002,498,560