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 1, 2026 17:11Karthik 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 1, 2026 17:110290,184,236159,708,0001,141,00020,480expected "53689157630792069 ", got "53689157630792069 2 2 279 26497 58 1|26164 26276 26303 26151 26156 |279864 "
2Oct 1, 2026 17:110289,882,547159,448,0001,082,00020,480expected "53688672947470664 ", got "53688672947470664 2 2 262 26401 55 1|26146 26215 26228 26120 26115 |279536 "
3Oct 1, 2026 17:110290,785,645160,397,0001,009,00020,480expected "53698560383469105 ", got "53698560383469105 3 2 265 27176 53 1|26112 26263 26228 26224 26126 |280441 "