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 listDec 30, 2022 01:15Alexander KimAlexander KimScore: 29,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2022 01:1529,730275,860,262246,755,00002,326,528
2Dec 30, 2022 01:1529,730272,031,212245,758,000999,0002,326,528
3Dec 30, 2022 01:1529,730270,586,570243,760,0002,997,0002,285,568
4Dec 30, 2022 01:1529,734278,303,241244,797,0001,998,0002,498,560
5Dec 30, 2022 01:1529,735273,135,066245,798,000999,0002,498,560
6Dec 30, 2022 01:1529,736272,336,792243,814,0002,997,0002,326,528
7Dec 30, 2022 01:1529,761276,450,769244,019,0003,000,0002,498,560
8Dec 30, 2022 01:1529,773271,065,628243,111,0004,001,0002,502,656
9Dec 30, 2022 01:1529,773267,519,834244,114,0003,001,0002,498,560
10Dec 30, 2022 01:1529,914312,933,083248,287,06702,297,856
11Dec 30, 2022 01:1529,986309,788,466248,884,00302,191,360
12Dec 30, 2022 01:1530,003323,304,844249,023,06002,187,264