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 listMay 20, 2026 05:57M-RochatM-RochatScore: 11,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:5711,798108,751,26795,918,0002,009,0002,113,536
2May 20, 2026 05:5711,799109,401,35995,598,0002,338,0002,113,536
3May 20, 2026 05:5711,805110,027,13295,634,0002,348,0002,113,536
4May 20, 2026 05:5711,809109,473,99295,680,0002,341,0002,113,536
5May 20, 2026 05:5711,809108,204,02395,678,0002,341,0002,113,536
6May 20, 2026 05:5711,853108,634,95996,378,0002,010,0002,113,536
7May 20, 2026 05:5711,887111,066,33996,609,0002,059,0002,113,536
8May 20, 2026 05:5711,898109,383,41796,693,0002,062,0002,113,536
9May 20, 2026 05:5711,941110,815,58197,047,0002,071,0002,113,536