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 30, 2022 15:41Yuriy LyfenkoYuriy LyfenkoScore: 9,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2022 15:419,57099,854,30476,415,0003,016,0002,498,560
2Jul 30, 2022 15:419,580105,953,68277,504,0002,013,0002,445,312
3Jul 30, 2022 15:419,652107,238,81074,104,0006,008,0002,478,080
4Jul 30, 2022 15:419,653100,870,78677,120,0003,004,0002,506,752
5Jul 30, 2022 15:419,664102,940,14477,201,0003,007,0002,400,256
6Jul 30, 2022 15:419,840106,799,70378,650,0003,025,0002,465,792
7Jul 30, 2022 15:419,922104,952,78981,352,0001,004,0002,404,352
8Jul 30, 2022 15:419,959109,524,54279,634,0003,024,0002,486,272
9Jul 30, 2022 15:4110,178150,044,47984,481,50102,199,552
10Jul 30, 2022 15:4110,212140,923,78084,759,02702,269,184
11Jul 30, 2022 15:4110,318138,850,49985,643,01402,297,856
12Jul 30, 2022 15:4110,592111,128,97886,914,000999,0002,318,336