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 4, 2021 22:35Yuriy LyfenkoYuriy LyfenkoScore: 23,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2021 22:3523,496218,426,226193,015,0002,000,0002,260,992
2May 4, 2021 22:3523,498221,634,519194,037,0001,000,0002,387,968
3May 4, 2021 22:3523,514223,098,259194,169,0001,000,0002,260,992
4May 4, 2021 22:3523,518221,061,033192,200,0003,003,0002,260,992
5May 4, 2021 22:3523,525216,827,349190,252,0005,006,0002,260,992
6May 4, 2021 22:3523,532221,747,405194,311,0001,001,0002,260,992
7May 4, 2021 22:3523,534219,928,962194,328,0001,001,0002,260,992
8May 4, 2021 22:3523,546225,371,910193,426,0002,004,0002,260,992
9May 4, 2021 22:3523,548231,488,371194,443,0001,002,0002,260,992