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 19, 2021 20:08Yuriy LyfenkoYuriy LyfenkoScore: 17,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:0817,482870,069,630144,091,0001,007,0002,265,088
2May 19, 2021 20:0817,4901,010,899,943144,156,0001,008,0002,265,088
3May 19, 2021 20:0817,4951,005,797,072142,223,0002,983,0002,523,136
4May 19, 2021 20:0817,496754,266,625144,222,000994,0002,523,136
5May 19, 2021 20:0817,4962,776,752,539143,227,0001,989,0002,519,040
6May 19, 2021 20:0817,4981,162,698,166144,237,000994,0002,269,184
7May 19, 2021 20:0817,5091,534,784,957142,337,0002,986,0002,265,088
8May 19, 2021 20:0817,514911,674,708143,373,0001,991,0002,519,040
9May 19, 2021 20:0817,5192,241,923,342144,403,0001,002,0002,519,040
10May 19, 2021 20:0817,9821,393,128,388149,250,33502,273,280
11May 19, 2021 20:0817,9832,913,606,810149,262,71202,273,280
12May 19, 2021 20:0817,9872,788,766,174149,294,79402,273,280