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 listJul 31, 2026 17:53George SeabridgeGeorge SeabridgeScore: 8,828Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:50Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:538,79483,083,41871,858,0001,140,0002,117,632
2Jul 31, 2026 17:538,80683,028,58471,943,0001,148,0002,117,632
3Jul 31, 2026 17:538,81583,200,78072,020,0001,151,0002,117,632
4Jul 31, 2026 17:538,82183,221,97372,073,0001,143,0002,117,632
5Jul 31, 2026 17:538,82884,090,28472,109,0001,168,0002,117,632
6Jul 31, 2026 17:538,84583,393,64172,270,0001,144,0002,117,632
7Jul 31, 2026 17:538,84683,506,26972,285,0001,137,0002,117,632
8Jul 31, 2026 17:538,85583,460,71972,360,0001,140,0002,117,632
9Jul 31, 2026 17:538,87983,741,73272,551,0001,150,0002,117,632