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 listDec 21, 2021 23:26Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2021 23:3500000Error: expected "53681433069560221 ", got "53681433069304321 "
2Dec 21, 2021 23:3600000Error: expected "53688510349321658 ", got "53688510093421658 "
3Dec 21, 2021 23:2633,099336,680,685274,718,72202,220,032
4Dec 21, 2021 23:3333,115345,979,544274,851,72502,224,128
5Dec 21, 2021 23:3333,118335,603,887274,881,26202,215,936
6Dec 21, 2021 23:2633,139347,762,710275,053,10102,220,032
7Dec 21, 2021 23:3333,200342,234,125275,563,41202,211,840
8Dec 21, 2021 23:2633,210335,544,917275,646,38602,203,648