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 listOct 9, 2023 16:35Vladimir TatVladimir TatScore: 84,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2023 16:1584,033771,255,856697,473,67802,265,088
2Oct 9, 2023 16:1584,046756,157,309697,585,12902,252,800
3Oct 9, 2023 16:3584,118749,794,983698,182,45902,252,800
4Oct 9, 2023 16:3584,121771,629,472698,205,07302,252,800
5Oct 9, 2023 16:3584,166759,109,540698,577,37802,260,992
6Oct 9, 2023 16:1584,220765,142,343699,022,26702,252,800