Create a 100-bit binary ripple-carry adder by instantiating 100 full adders. The adder adds two 100-bit numbers and a carry-in to produce a 100-bit sum and carry out. To encourage you to actually instantiate full adders, also output the carry-out from each full adder in the ripple-carry adder. cout[99] is the final carry-out from the last full adder, and is the carry-out you usually see.
module fulladd(
input a, b, cin,
output cout, sum );
assign sum=a^b^cin;
assign cout=(a&b)|(a&cin)|(b&cin);
endmodule
module top_module(
input [99:0] a, b,
input cin,
output [99:0] cout,
output [99:0] sum );
fulladd inst[99:0] (
.a(a[99:0]),
.b(b[99:0]),
.cin({cout[98:0],cin}),
.cout(cout[99:0]),
.sum(sum[99:0]));
endmodule