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 14, 2023 18:20Sergey SlotinSergey SlotinScore: 19,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2023 18:2019,528189,180,075159,084,0003,001,0002,256,896
2Jul 14, 2023 18:2019,537190,725,650159,151,0003,002,0002,519,040
3Jul 14, 2023 18:2019,543188,450,511161,205,0001,001,0002,359,296
4Jul 14, 2023 18:2019,543187,401,416160,205,0002,002,0002,359,296
5Jul 14, 2023 18:2019,546186,484,740161,228,0001,001,0002,478,080
6Jul 14, 2023 18:2019,551188,355,321160,271,0002,003,0002,256,896
7Jul 14, 2023 18:2019,552187,943,622160,282,0002,003,0002,256,896
8Jul 14, 2023 18:2019,556186,366,906159,308,0003,005,0002,519,040
9Jul 14, 2023 18:2019,602190,754,789160,704,0001,996,0002,260,992
10Jul 14, 2023 18:2022,300244,585,841185,087,21702,265,088
11Jul 14, 2023 18:2022,342248,843,020185,441,17902,265,088
12Jul 14, 2023 18:2022,433246,332,807186,197,19002,256,896