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 listApr 14, 2024 10:45Matt StuchlikMatt StuchlikScore: 20,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2024 10:4518,305211,078,453151,931,67102,281,472
2Apr 14, 2024 10:4518,308207,618,733151,956,98402,281,472
3Apr 14, 2024 10:4518,313210,066,261151,994,16402,289,664
4Apr 14, 2024 10:4520,030192,858,933164,248,0002,003,0002,269,184
5Apr 14, 2024 10:4520,185198,274,986167,539,00002,277,376
6Apr 14, 2024 10:4520,186192,633,947167,545,00002,260,992
7Apr 14, 2024 10:4520,197195,199,147166,633,0001,003,0002,285,568
8Apr 14, 2024 10:4520,331200,188,940166,753,0001,997,0002,285,568
9Apr 14, 2024 10:4520,367196,749,091167,042,0002,000,0002,273,280
10Apr 14, 2024 10:4520,395194,862,983168,275,0001,001,0002,260,992
11Apr 14, 2024 10:4520,449197,023,483168,729,000998,0002,285,568
12Apr 14, 2024 10:4520,506193,301,766168,195,0002,002,0002,285,568