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 listOct 14, 2024 15:59Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:15Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:15042,825,21633,678,0001,024,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
2Jul 7, 2026 00:15042,738,05033,635,0001,021,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
3Jul 7, 2026 00:15042,770,19633,690,0001,021,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
4Oct 14, 2024 15:594,32360,267,69434,887,000996,0002,314,240
5Oct 14, 2024 15:594,35356,589,85834,122,0002,007,0002,306,048
6Oct 14, 2024 15:594,42360,206,53835,689,0001,019,0002,297,856