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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:24041,391,50332,147,0001,014,0002,117,632expected "74600294196621100 ", got "44815897871441452 "
2Jul 6, 2026 22:24042,941,70933,957,0001,105,0002,117,632expected "74600294196621100 ", got "45557917068219180 "
3Jul 6, 2026 22:24041,374,35532,095,0001,172,0002,117,632expected "74600294196621100 ", got "44816138773368108 "
4Mar 14, 2026 21:534,23363,797,48533,126,0002,007,0002,498,560
5Mar 14, 2026 21:534,26161,389,53234,360,0001,010,0002,273,280
6Mar 14, 2026 21:534,57363,490,68135,956,0001,997,0002,273,280