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 8, 2023 14:19Kevin HeaveyKevin HeaveyScore: 47,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2023 14:1947,092452,643,114390,861,50302,232,320
2Sep 8, 2023 14:1947,111454,922,714391,018,99802,224,128
3Sep 8, 2023 14:1947,123466,284,645391,119,24102,256,896
4Sep 8, 2023 14:1947,152459,865,511391,364,97502,224,128
5Sep 8, 2023 14:1947,154468,007,125391,381,73202,224,128
6Sep 8, 2023 14:1947,167468,502,778391,489,67002,224,128
7Sep 8, 2023 14:1947,169456,265,208391,504,58002,220,032
8Sep 8, 2023 14:1947,188461,720,900391,660,72102,224,128
9Sep 8, 2023 14:1947,199456,275,942391,750,45502,232,320