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 listSep 7, 2026 19:46neel-bhavsarneel-bhavsarError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:460161,814,80061,674,00090,234,00020,480expected "53687183971259774 ", got "16580227815561970 "
2Sep 7, 2026 19:460161,513,41061,859,00089,776,00020,480expected "53687122616311928 ", got "16583024267899260 "
3Sep 7, 2026 19:460161,542,12062,033,00089,596,00020,480expected "53685235954530734 ", got "16585409936965020 "