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 18, 2026 15:53Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:23042,691,57933,312,0001,204,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 7, 2026 01:23043,304,56034,309,0001,084,0002,117,632expected "74600294196621100 ", got "20786055928333220 "
3Jul 7, 2026 01:23042,648,20133,483,0001,008,0002,117,632expected "74600294196621100 ", got "20786062482452268 "
4Apr 18, 2026 15:534,35657,661,99834,149,0002,008,0002,469,888
5Apr 18, 2026 15:534,38464,332,11935,375,0001,010,0002,535,424
6Apr 18, 2026 15:534,39655,526,71935,471,0001,013,0002,535,424