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 18:51Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:54Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:54044,030,22835,024,0001,129,0002,117,632expected "74600294196621100 ", got "17327655678029612 "
2Jul 7, 2026 01:54044,083,02935,083,0001,105,0002,117,632expected "74600294196621100 ", got "17327655678029612 "
3Jul 7, 2026 01:54044,447,67435,501,0001,053,0002,117,632expected "74600294196621100 ", got "17327655678029612 "
4Apr 13, 2026 18:514,50858,233,36835,396,0002,022,0002,535,424
5Apr 13, 2026 18:514,51261,593,23736,434,0001,012,0002,490,368
6Apr 13, 2026 18:514,56164,526,72537,854,00002,473,984