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:08042,943,37926,187,0007,758,00020,480expected "53689018476600858 ", got "0 4996 4416 4191 4123 4123 4128 4100 4128 4112 4103 4177 4114 4174 4115 4126 26043 0 "
2Oct 6, 2026 00:08043,073,88726,197,0007,894,00020,480expected "53682392693003957 ", got "0 5006 4414 4150 4157 4084 4160 4109 4104 4093 4101 4114 4100 4174 4092 4104 26054 1 "
3Oct 6, 2026 00:08043,039,68926,302,0007,767,00020,480expected "53684770258432040 ", got "0 5005 4419 4202 4128 4118 4149 4105 4183 4119 4121 4161 4117 4128 4119 4138 26155 0 "