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 19, 2026 08:06wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:02Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:03040,275,28329,900,0001,006,0002,113,536expected "74600294196621100 ", got "74528075078850709 "
2Jul 6, 2026 17:03039,089,10929,986,0001,043,0002,113,536expected "74600294196621100 ", got "74594332458318377 "
3Jul 6, 2026 17:03038,435,94129,407,0001,019,0002,113,536expected "74600294196621100 ", got "74593723450439377 "
4Apr 19, 2026 08:063,55153,872,37728,456,0001,016,0002,498,560
5Apr 19, 2026 08:063,55352,203,74528,470,0001,016,0002,277,376
6Apr 19, 2026 08:063,61855,412,40028,028,0002,002,0002,527,232