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:28Karthik 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,968,42925,186,0003,533,00020,480expected "53684708042366587 ", got "M0 pop2041 iv0 v0 gaps0 0us x0 "
2Oct 2, 2026 18:29038,091,31325,188,0003,683,00020,480expected "53687100436835512 ", got "M0 pop2110 iv0 v0 gaps0 0us x0 "
3Oct 2, 2026 18:29038,447,03125,184,0003,970,00020,480expected "53689782887857166 ", got "M0 pop2267 iv0 v0 gaps0 0us x0 "