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:05Karthik 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:05063,445,28453,288,0001,144,00020,480expected "53688385272729077 ", got "53688385272729077 2 3 273 26471 57 1|112 251 81 229 26191 118 |53789 "
2Oct 1, 2026 17:05063,425,44053,268,0001,115,00020,480expected "53680719070801665 ", got "53680719070801665 2 2 263 26505 55 1|110 251 85 233 26107 119 |53734 "
3Oct 1, 2026 17:05063,665,79653,504,0001,098,00020,480expected "53685622074749938 ", got "53685622074749938 2 2 265 26530 51 1|110 255 87 236 26279 119 |53937 "