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 listMay 28, 2021 21:36Yuriy LyfenkoYuriy LyfenkoScore: 17,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2021 21:3617,199167,625,451140,752,0001,996,0002,260,992
2May 28, 2021 21:3617,200170,859,566141,765,000998,0002,260,992
3May 28, 2021 21:3617,202168,770,326141,777,000998,0002,523,136
4May 28, 2021 21:3617,203172,326,795140,789,0001,997,0002,260,992
5May 28, 2021 21:3617,218170,684,118141,908,000999,0002,260,992
6May 28, 2021 21:3617,227172,862,527140,983,0001,999,0002,260,992
7May 28, 2021 21:3617,233166,216,270141,038,0002,000,0002,404,352
8May 28, 2021 21:3617,330173,406,209141,843,0001,997,0002,392,064
9May 28, 2021 21:3617,350168,952,116143,008,0001,000,0002,260,992
10May 28, 2021 21:3617,568187,570,371145,818,06502,269,184
11May 28, 2021 21:3617,580187,952,588145,916,77202,273,280
12May 28, 2021 21:3617,585234,243,621145,954,76202,269,184