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 01:38Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 15:04M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:31031,623,15620,975,0001,033,0002,121,728expected "11318049299365247 ", got "32283932243369606 "stderr
2May 17, 2026 15:31031,628,82820,868,0001,305,0002,121,728expected "11318049299365247 ", got "32283932243369606 "stderr
3May 17, 2026 15:31031,437,68620,577,0001,029,0002,121,728expected "11318049299365247 ", got "32283932243369606 "stderr
4Nov 27, 2024 01:384,25460,291,97833,292,0002,017,0002,535,424
5Nov 27, 2024 01:384,25560,977,74132,291,0003,027,0002,297,856
6Nov 27, 2024 01:384,31860,554,91334,845,000995,0002,306,048