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 listFeb 16, 2024 10:13Huy Duc LeHuy Duc LeScore: 21,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 10:1321,741211,745,030180,447,00002,265,088
2Feb 16, 2024 10:1321,743204,309,360179,465,0001,002,0002,273,280
3Feb 16, 2024 10:1321,750207,709,830179,526,0001,002,0002,289,664
4Feb 16, 2024 10:1321,754208,842,800179,556,0001,003,0002,273,280
5Feb 16, 2024 10:1321,757208,286,694179,576,0001,003,0002,285,568
6Feb 16, 2024 10:1321,757210,121,765179,584,000997,0002,285,568
7Feb 16, 2024 10:1321,760205,407,921179,606,0001,003,0002,285,568
8Feb 16, 2024 10:1321,771255,413,528180,699,55102,293,760
9Feb 16, 2024 10:1321,776209,009,825178,744,0001,997,0002,277,376
10Feb 16, 2024 10:1322,340247,070,027185,418,16402,289,664
11Feb 16, 2024 10:1322,409253,217,210185,992,87502,285,568
12Feb 16, 2024 10:1322,501212,965,580184,763,0001,997,0002,277,376