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 listSep 9, 2021 15:42Andrey TsvetkovAndrey TsvetkovScore: 32,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2021 15:2532,645352,681,604270,956,52202,220,032
2Sep 9, 2021 15:2532,654333,521,548271,030,84102,211,840
3Sep 9, 2021 15:4232,663330,465,159271,105,57202,224,128
4Sep 9, 2021 15:2532,665334,914,582271,121,19202,224,128
5Sep 9, 2021 15:4232,667342,080,753271,135,03402,228,224
6Sep 9, 2021 15:4232,671328,554,258271,170,15602,211,840