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 listOct 6, 2026 00:07Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 00:07052,424,65226,557,00016,935,00020,480expected "53687319731761683 ", got "0 5291 4642 4329 4257 4273 4248 4245 4299 4281 4304 4142 4135 4112 4103 4123 26422 1 "
2Oct 6, 2026 00:07053,309,64826,831,00017,493,00020,480expected "53683837507497869 ", got "0 5274 4634 4325 4357 4264 4298 4251 4290 4256 4271 4282 4255 4286 4256 4280 26712 0 "
3Oct 6, 2026 00:07054,270,69626,853,00017,087,00020,480expected "53693541220129255 ", got "0 5234 4577 4316 4247 4259 4299 4251 4345 4255 4277 4243 4237 4269 4233 4343 26715 0 "