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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:27M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:03029,934,10020,313,0001,210,0002,121,728expected "11318049299365247 ", got "32283932243369606 "stderr
2May 17, 2026 15:03030,349,70820,389,0001,202,0002,121,728expected "11318049299365247 ", got "32283932243369606 "stderr
3May 17, 2026 15:03031,581,10620,932,0001,037,0002,121,728expected "11318049299365247 ", got "32283932243369606 "stderr
4Nov 27, 2024 02:004,24162,743,08035,202,00002,273,280
5Nov 27, 2024 02:004,25360,142,68633,286,0002,017,0002,306,048
6Nov 27, 2024 02:004,34957,286,52934,088,0002,005,0002,396,160