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 5, 2021 19:39Yuriy LyfenkoYuriy LyfenkoScore: 23,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 19:3923,792227,904,819197,471,00002,392,064
2May 5, 2021 19:3923,794220,126,448196,492,0001,002,0002,260,992
3May 5, 2021 19:3923,808224,739,552196,606,0001,003,0002,392,064
4May 5, 2021 19:3923,809223,207,684195,610,0002,006,0002,260,992
5May 5, 2021 19:3923,810223,645,942197,622,00002,260,992
6May 5, 2021 19:3923,820223,825,418193,713,0003,994,0002,396,160
7May 5, 2021 19:3923,828223,981,967194,779,0002,996,0002,396,160
8May 5, 2021 19:3923,828225,780,613195,769,0002,007,0002,396,160
9May 5, 2021 19:3923,844225,325,572196,906,000999,0002,260,992