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 30, 2021 03:11Yuriy LyfenkoYuriy LyfenkoScore: 13,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2021 03:1113,843389,342,952112,900,0001,998,0002,379,776
2Jun 30, 2021 03:1113,853389,047,948112,981,0001,999,0002,392,064
3Jun 30, 2021 03:1113,862389,974,379114,054,0001,000,0002,523,136
4Jun 30, 2021 03:1113,868392,336,747113,106,0002,001,0002,260,992
5Jun 30, 2021 03:1113,873388,214,897114,147,0001,001,0002,260,992
6Jun 30, 2021 03:1113,873396,050,480114,149,0001,001,0002,387,968
7Jun 30, 2021 03:1113,875394,178,802115,166,00002,260,992
8Jun 30, 2021 03:1113,878399,294,638114,190,0001,001,0002,379,776
9Jun 30, 2021 03:1113,891390,543,949115,293,00002,260,992
10Jun 30, 2021 03:1114,268429,188,759118,422,81702,265,088
11Jun 30, 2021 03:1114,280430,180,920118,523,45802,269,184
12Jun 30, 2021 03:1114,283428,437,053118,547,40002,244,608