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 listMay 28, 2024 01:23Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2024 01:2300000Error: Exit with code 1: Segmentation fault at address: 335609984stderr
2May 28, 2024 01:2500000Error: expected "53692244801083055 ", got "53692256691377801 "
3May 28, 2024 01:2600000Error: Exit with code 1: Segmentation fault at address: 1208025152stderr
4May 28, 2024 01:2800000Error: expected "53690451306328757 ", got "53690462436709440 "
5May 28, 2024 01:276,178123,547,44151,273,95002,203,648
6May 28, 2024 01:246,265118,222,25152,002,04802,187,264
7May 28, 2024 01:246,270132,052,33352,038,16802,195,456
8May 28, 2024 01:246,299117,877,92052,278,69302,191,360
9May 28, 2024 01:276,328105,121,95352,523,42202,220,032
10May 28, 2024 01:296,358108,607,49352,772,48202,301,952
11May 28, 2024 01:276,376120,877,57152,923,63602,301,952
12May 28, 2024 01:296,393133,890,29753,059,14302,199,552
13May 28, 2024 01:296,454112,664,19353,568,64102,191,360