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 12, 2023 00:54Kevin HeaveyKevin HeaveyScore: 52,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2023 00:5452,834501,178,607438,521,82002,228,224
2Jan 12, 2023 00:5452,835506,175,764438,528,45502,215,936
3Jan 12, 2023 00:5452,837509,025,043438,549,20802,228,224
4Jan 12, 2023 00:5452,855508,576,434438,696,11902,232,320
5Jan 12, 2023 00:5452,860511,532,054438,741,22802,224,128
6Jan 12, 2023 00:5452,878505,265,678438,885,42602,224,128