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 21:25Yuriy LyfenkoYuriy LyfenkoScore: 14,307Success
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 21:2514,278397,660,325117,502,0001,004,0002,260,992
2Jun 30, 2021 21:2514,294400,597,994116,646,0001,993,0002,387,968
3Jun 30, 2021 21:2514,295391,354,828117,651,000997,0002,260,992
4Jun 30, 2021 21:2514,297393,950,759117,664,000997,0002,387,968
5Jun 30, 2021 21:2514,298400,065,834117,667,0001,005,0002,260,992
6Jun 30, 2021 21:2514,301394,127,476117,703,000997,0002,260,992
7Jun 30, 2021 21:2514,307394,981,052116,751,0001,995,0002,260,992
8Jun 30, 2021 21:2514,311399,685,158117,783,000998,0002,523,136
9Jun 30, 2021 21:2514,330397,131,374117,936,000999,0002,260,992
10Jun 30, 2021 21:2514,503428,840,821120,373,48102,273,280
11Jun 30, 2021 21:2514,514426,632,350120,462,17202,265,088
12Jun 30, 2021 21:2514,523430,920,534120,542,06802,269,184