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:07050,785,03126,510,00015,264,00020,480expected "53683807271693766 ", got "0 5487 4387 4103 4102 4128 4100 4126 4104 4155 4113 4101 4174 4106 4128 4095 26383 1 "
2Oct 6, 2026 00:07053,367,78726,517,00017,860,00020,480expected "53688353083758837 ", got "0 4952 4431 4140 4105 4165 4102 4134 4104 4102 4096 4096 4116 4092 4161 4104 26388 0 "
3Oct 6, 2026 00:07052,430,19526,685,00016,824,00020,480expected "53693070938494496 ", got "0 5030 4465 4168 4126 4135 4121 4143 4116 4163 4153 4110 4183 4122 4133 4116 26559 0 "