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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:43042,234,01033,240,0001,042,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 6, 2026 23:43042,188,66933,323,0001,024,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 6, 2026 23:43043,443,64234,140,0001,178,0002,117,632expected "74600294196621100 ", got "20786187000852268 "
4Apr 18, 2026 15:524,29562,923,60634,632,0001,018,0002,461,696
5Apr 18, 2026 15:524,29759,759,26934,650,0001,019,0002,465,792
6Apr 18, 2026 15:524,33658,207,51833,992,0001,999,0002,535,424