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 listJun 11, 2021 11:12Dmitry DolgopolovDmitry DolgopolovScore: 27,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 11:1227,830252,985,348228,988,0001,999,0002,285,568
2Jun 11, 2021 11:1227,833255,734,671231,012,00002,289,664
3Jun 11, 2021 11:1227,836256,244,299230,035,0001,000,0002,285,568
4Jun 11, 2021 11:1227,844255,629,957229,103,0002,000,0002,289,664
5Jun 11, 2021 11:1227,846256,127,949229,119,0002,001,0002,269,184
6Jun 11, 2021 11:1227,849253,874,111229,144,0002,001,0002,273,280
7Jun 11, 2021 11:1227,852253,691,752229,172,0002,001,0002,265,088
8Jun 11, 2021 11:1227,854256,024,058229,185,0002,001,0002,519,040
9Jun 11, 2021 11:1227,859255,099,596229,230,0002,002,0002,285,568
10Jun 11, 2021 11:1228,014287,272,299232,512,79002,289,664
11Jun 11, 2021 11:1228,015289,141,932232,526,68702,285,568
12Jun 11, 2021 11:1228,024289,839,692232,597,69702,285,568