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 listSep 11, 2024 15:52Dmitrii KravchenkoDmitrii KravchenkoScore: 66,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2024 15:5266,833583,146,836490,750,00063,967,0002,289,664
2Sep 11, 2024 15:5266,855581,816,914497,909,00056,989,0002,289,664
3Sep 11, 2024 15:5266,867582,912,548489,999,00064,999,0002,506,752
4Sep 11, 2024 15:5266,873575,990,878494,043,00061,005,000188,416
5Sep 11, 2024 15:5266,912586,317,635511,337,00044,029,0002,506,752
6Sep 11, 2024 15:5266,956585,619,826484,767,00070,965,0002,289,664
7Sep 11, 2024 15:5267,076580,326,777501,760,00054,973,0002,510,848
8Sep 11, 2024 15:5267,084584,752,956488,826,00067,975,0002,510,848
9Sep 11, 2024 15:5267,123585,934,691496,110,00061,013,0002,281,472