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 00:42Joad NacerJoad NacerScore: 5,537Success
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 00:425,52566,368,04444,841,0001,019,0002,306,048
2Oct 11, 2024 00:425,52769,023,89742,884,0002,991,0002,306,048
3Oct 11, 2024 00:425,52772,953,37143,837,0002,038,0002,306,048
4Oct 11, 2024 00:425,53772,743,13943,960,0001,998,0002,306,048
5Oct 11, 2024 00:425,53774,388,19543,956,0001,998,0002,306,048
6Oct 11, 2024 00:425,55974,045,70343,128,0003,008,0002,514,944
7Oct 11, 2024 00:425,64170,728,39444,831,0001,992,0002,301,952
8Oct 11, 2024 00:425,64169,836,87243,836,0002,988,0002,301,952
9Oct 11, 2024 00:425,65073,280,06044,896,0001,995,0002,301,952