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 28, 2021 21:41Yuriy LyfenkoYuriy LyfenkoScore: 17,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2021 21:4117,182170,599,737142,612,00002,392,064
2May 28, 2021 21:4117,198173,890,471140,750,0001,996,0002,260,992
3May 28, 2021 21:4117,199172,933,407140,759,0001,996,0002,260,992
4May 28, 2021 21:4117,216169,533,369140,895,0001,998,0002,260,992
5May 28, 2021 21:4117,219169,353,902140,918,0001,998,0002,260,992
6May 28, 2021 21:4117,330175,252,493142,841,000998,0002,392,064
7May 28, 2021 21:4117,345174,189,139142,961,000999,0002,260,992
8May 28, 2021 21:4117,529187,955,867145,490,04302,265,088
9May 28, 2021 21:4117,543172,192,306145,606,00002,260,992
10May 28, 2021 21:4117,588231,334,317145,983,92802,273,280
11May 28, 2021 21:4117,730174,936,395145,156,0002,002,0002,260,992
12May 28, 2021 21:4118,309207,747,535151,966,96002,265,088