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 11, 2024 02:40Joad NacerJoad NacerScore: 6,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 02:406,82085,681,34655,600,0001,010,0002,498,560
2Oct 11, 2024 02:406,84682,498,36453,832,0002,990,0002,334,720
3Oct 11, 2024 02:406,85181,560,43154,870,0001,995,0002,514,944
4Oct 11, 2024 02:406,97978,162,02956,929,000998,0002,506,752
5Oct 11, 2024 02:406,98879,333,48756,003,0002,000,0002,506,752
6Oct 11, 2024 02:406,99682,483,99055,066,0003,003,0002,506,752