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 2, 2023 20:20dzaimadzaimaScore: 18,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2023 20:2018,717180,308,460154,351,0001,002,0002,453,504
2Jul 2, 2023 20:2018,745180,779,507154,578,0001,003,0002,465,792
3Jul 2, 2023 20:2018,749178,043,493154,611,0001,003,0002,461,696
4Jul 2, 2023 20:2018,758181,731,848153,698,0001,996,0002,359,296
5Jul 2, 2023 20:2018,762181,939,480153,727,0001,996,0002,379,776
6Jul 2, 2023 20:2018,763184,843,962153,733,0001,996,0002,359,296
7Jul 2, 2023 20:2018,765184,647,904154,752,000998,0002,465,792
8Jul 2, 2023 20:2018,779183,839,857153,867,0001,998,0002,367,488
9Jul 2, 2023 20:2018,781185,256,198154,881,000999,0002,355,200
10Jul 2, 2023 20:2019,636229,178,622162,977,60302,277,376
11Jul 2, 2023 20:2019,640243,624,142163,010,86102,285,568
12Jul 2, 2023 20:2019,640220,521,224163,014,97602,285,568