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 24, 2026 08:32wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 08:370620,540,911610,741,0001,003,0002,113,536expected "53684623895071455 ", got "18446744073709551012 53684623895071455 25295750365 524126116 0 11788 10125 11959 11929 10129 11809 31101 31514 26686 26385 26346 "
2Sep 24, 2026 08:370620,389,482610,547,0001,006,0002,113,536expected "53686534435945176 ", got "18446744073709551012 53686534435945176 25295943529 524131088 0 11883 10108 11957 11966 10108 11892 31225 31390 26548 26270 26245 "
3Sep 24, 2026 08:370618,210,068608,242,0001,053,0002,113,536expected "53690887369080225 ", got "18446744073709551012 53690887369080225 25295952028 524132017 0 11838 10099 12028 11963 10134 11840 31035 31438 26580 26240 26223 "