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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:40038,049,62328,934,0001,125,0002,113,536expected "74600294196621100 ", got "72475695971010348 "
2Jul 6, 2026 20:40037,716,10728,644,0001,081,0002,113,536expected "74600294196621100 ", got "72980122508813356 "
3Jul 6, 2026 20:40040,603,79931,518,0001,143,0002,113,536expected "74600294196621100 ", got "74097706807960876 "
4Apr 13, 2026 11:334,07663,523,48532,836,000995,0002,490,368
5Apr 13, 2026 11:334,15661,953,51033,481,0001,014,0002,482,176
6Apr 13, 2026 11:334,20257,113,28332,886,0001,993,0002,494,464