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 listNov 27, 2024 02:01Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:18Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:18042,422,66833,272,0001,022,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
2Jul 7, 2026 00:18042,297,81133,393,0001,026,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
3Jul 7, 2026 00:18042,205,60533,079,0001,021,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
4Nov 27, 2024 02:014,25860,719,45534,333,0001,009,0002,273,280
5Nov 27, 2024 02:014,35958,664,83833,164,0003,014,0002,535,424
6Nov 27, 2024 02:014,48961,142,32134,239,0003,021,0002,293,760