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 31, 2026 14:48Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:10045,323,52736,275,0001,152,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 03:10045,439,74136,212,0001,113,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
3Jul 7, 2026 03:10046,604,16737,344,0001,117,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 31, 2026 14:484,69769,899,98936,988,0001,999,0002,314,240
5Mar 31, 2026 14:484,70567,579,98437,046,0002,002,0002,465,792
6Mar 31, 2026 14:484,93067,599,37138,920,0001,995,0002,535,424