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:08Karthik 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:08044,253,87426,542,0008,803,00020,480expected "53700011560029750 ", got "0 5273 4569 4308 4338 4246 4282 4273 4287 4246 4255 4339 4233 4347 4242 4277 26402 0 "
2Oct 6, 2026 00:08043,757,63226,549,0008,288,00020,480expected "53693196997871497 ", got "0 5281 4591 4372 4234 4229 4331 4242 4274 4235 4273 4242 4244 4342 4239 4317 26406 1 "
3Oct 6, 2026 00:08044,053,51526,652,0008,441,00020,480expected "53686985825580239 ", got "0 5284 4659 4334 4260 4354 4254 4276 4266 4291 4261 4258 4362 4259 4356 4268 26509 0 "