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 26, 2023 19:40Alexander KrivolapovAlexander KrivolapovScore: 19,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2023 19:4019,769229,920,809164,083,15302,228,224
2Dec 26, 2023 19:4019,783237,527,910164,194,83902,228,224
3Dec 26, 2023 19:4019,796235,044,946164,303,12202,236,416
4Dec 26, 2023 19:4019,858193,479,769162,821,0001,997,0002,285,568
5Dec 26, 2023 19:4019,905193,921,955163,209,0002,002,0002,285,568
6Dec 26, 2023 19:4019,910197,743,891164,253,0001,001,0002,506,752
7Dec 26, 2023 19:4019,911194,753,089164,260,0001,001,0002,289,664
8Dec 26, 2023 19:4019,913186,481,600164,280,0001,001,0002,502,656
9Dec 26, 2023 19:4019,916197,248,310164,298,0001,001,0002,289,664
10Dec 26, 2023 19:4019,930188,385,522165,418,00002,285,568
11Dec 26, 2023 19:4019,940193,883,961164,498,0001,003,0002,285,568
12Dec 26, 2023 19:4019,947193,845,897164,553,0001,003,0002,285,568