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 16, 2024 23:41Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:36Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:36042,045,51232,953,0001,027,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
2Jul 6, 2026 23:36042,237,81933,103,0001,025,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
3Jul 6, 2026 23:36042,140,38033,000,0001,025,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
4Oct 16, 2024 23:414,27459,227,48134,465,0001,013,0002,535,424
5Oct 16, 2024 23:414,28560,212,96835,566,00002,306,048
6Oct 16, 2024 23:414,31863,454,77134,842,000995,0002,535,424