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 2, 2026 18:29Karthik 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 2, 2026 18:29037,366,82725,887,0002,694,00024,576expected "53686545846896575 ", got "M3 pop2896 iv0 v0 gaps0 0us x0 "
2Oct 2, 2026 18:29037,738,99925,251,0003,808,00020,480expected "53691799173317866 ", got "M3 pop3359 iv0 v0 gaps0 0us x1 "
3Oct 2, 2026 18:29037,802,07925,241,0003,870,00024,576expected "53691217727858761 ", got "M3 pop3418 iv0 v0 gaps0 0us x0 "