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:48Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:48043,510,44434,375,0001,206,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 7, 2026 01:48045,209,92434,913,0001,069,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 7, 2026 01:48044,083,38135,104,0001,082,0002,117,632expected "74600294196621100 ", got "20785990392332320 "
4Apr 18, 2026 15:534,45459,297,73534,967,0001,998,0002,535,424
5Apr 18, 2026 15:534,47258,671,09935,112,0002,006,0002,289,664
6Apr 18, 2026 15:534,47459,654,15035,129,0002,007,0002,535,424