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 listOct 1, 2023 21:36sliceteamsliceteamScore: 16,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2023 21:3616,300160,690,934134,288,0001,002,0002,523,136
2Oct 1, 2023 21:3616,432189,648,814136,385,41402,269,184
3Oct 1, 2023 21:3616,435201,128,908136,413,00502,273,280
4Oct 1, 2023 21:3616,450159,105,867135,531,0001,003,0002,387,968
5Oct 1, 2023 21:3616,452159,592,206135,544,0001,004,0002,387,968
6Oct 1, 2023 21:3616,462163,210,903135,627,0001,004,0002,392,064
7Oct 1, 2023 21:3616,462161,652,299136,631,00002,260,992
8Oct 1, 2023 21:3616,464162,626,581135,651,0001,004,0002,379,776
9Oct 1, 2023 21:3616,479164,912,518134,782,0001,996,0002,260,992
10Oct 1, 2023 21:3616,482163,692,843135,802,000998,0002,260,992
11Oct 1, 2023 21:3616,483167,323,668136,805,00002,260,992
12Oct 1, 2023 21:3616,948212,546,100140,664,58202,273,280