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,202,21726,165,0009,117,00020,480expected "53688230366467425 ", got "0 5419 4261 4091 4145 4103 4109 4080 4095 4118 4090 4166 4083 4076 4157 4096 26026 1 "
2Oct 6, 2026 00:08044,521,67426,276,0009,280,00020,480expected "53689997487827119 ", got "0 5014 4443 4152 4124 4128 4111 4114 4111 4158 4120 4116 4151 4112 4123 4121 26134 1 "
3Oct 6, 2026 00:08044,327,02526,254,0009,067,00020,480expected "53686358051071238 ", got "0 5014 4426 4155 4118 4097 4114 4094 4105 4155 4098 4149 4091 4108 4121 4095 26111 0 "