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 listJan 17, 2022 01:40Yuriy LyfenkoYuriy LyfenkoScore: 29,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 01:4029,195267,333,098241,318,0001,001,0002,519,040
2Jan 17, 2022 01:4029,196304,844,323242,325,33702,215,936
3Jan 17, 2022 01:4029,196265,842,435241,325,0001,001,0002,527,232
4Jan 17, 2022 01:4029,201268,024,024241,365,0001,001,0002,392,064
5Jan 17, 2022 01:4029,202293,889,205242,378,66902,203,648
6Jan 17, 2022 01:4029,203267,265,234239,385,0003,004,0002,527,232
7Jan 17, 2022 01:4029,207311,527,227242,415,93202,215,936
8Jan 17, 2022 01:4029,219272,854,813241,517,0001,002,0002,326,528
9Jan 17, 2022 01:4029,224275,188,550240,552,0002,004,0002,531,328
10Jan 17, 2022 01:4029,230270,206,491240,602,0002,005,0002,326,528
11Jan 17, 2022 01:4029,246269,821,361239,749,0002,996,0002,326,528
12Jan 17, 2022 01:4029,247273,520,393241,755,000998,0002,527,232