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 listJan 10, 2022 04:33Yuriy LyfenkoYuriy LyfenkoScore: 14,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 04:3314,789399,024,825120,754,0001,995,0002,285,568
2Jan 10, 2022 04:3314,790398,918,213120,760,0001,996,0002,273,280
3Jan 10, 2022 04:3314,797399,499,675120,816,0001,996,0002,285,568
4Jan 10, 2022 04:3314,801394,713,530120,852,0001,997,0002,285,568
5Jan 10, 2022 04:3314,802394,796,610120,862,0001,997,0002,277,376
6Jan 10, 2022 04:3314,803394,244,515121,864,000998,0002,285,568
7Jan 10, 2022 04:3314,803395,306,193120,866,0001,997,0002,277,376
8Jan 10, 2022 04:3314,804396,679,562120,874,0001,997,0002,269,184
9Jan 10, 2022 04:3314,809399,670,791121,918,000999,0002,269,184
10Jan 10, 2022 04:3315,461439,091,406128,328,77802,252,800
11Jan 10, 2022 04:3315,470433,998,010128,398,69002,256,896
12Jan 10, 2022 04:3315,472448,946,941128,418,65702,285,568