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 00:46Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:41042,471,95533,249,0001,099,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
2Jul 6, 2026 23:41042,190,39432,970,0001,095,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
3Jul 6, 2026 23:41042,275,70433,114,0001,080,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
4Oct 14, 2024 00:464,29164,451,51733,583,0002,035,0002,273,280
5Oct 14, 2024 00:464,29767,199,47234,648,0001,019,0002,297,856
6Oct 14, 2024 00:464,44061,981,74034,860,0001,992,0002,297,856