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 7, 2024 22:27Yurkov AlekseyYurkov AlekseyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2024 22:2600000Error: No answer to stdout. Died or killed?
2Jan 7, 2024 22:2730,725315,046,210255,015,32902,293,760
3Jan 7, 2024 22:2730,741318,728,083255,153,15102,293,760
4Jan 7, 2024 22:2730,749333,884,953255,220,19702,285,568
5Jan 7, 2024 22:2730,753311,897,762255,249,64002,293,760
6Jan 7, 2024 22:2730,755315,882,563255,266,00302,289,664
7Jan 7, 2024 22:2730,759326,011,330255,301,82802,293,760
8Jan 7, 2024 22:2730,771317,523,465255,395,55502,285,568
9Jan 7, 2024 22:2730,786326,914,613255,525,81302,289,664
10Jan 7, 2024 22:2730,793317,419,196255,577,89902,289,664