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 2, 2023 01:57sliceteamsliceteamScore: 15,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2023 01:5715,878157,663,560130,791,000998,0002,260,992
2Oct 2, 2023 01:5715,882157,514,318129,821,0001,997,0002,519,040
3Oct 2, 2023 01:5715,884162,402,765130,832,0001,006,0002,523,136
4Oct 2, 2023 01:5715,892162,368,830129,908,0001,998,0002,502,656
5Oct 2, 2023 01:5715,893158,313,033129,917,0001,998,0002,387,968
6Oct 2, 2023 01:5715,911157,663,989131,062,0001,000,0002,260,992
7Oct 2, 2023 01:5715,914156,892,609130,088,0002,001,0002,260,992
8Oct 2, 2023 01:5715,915158,496,109131,098,0001,000,0002,392,064
9Oct 2, 2023 01:5716,285160,699,372134,168,0001,001,0002,260,992
10Oct 2, 2023 01:5716,464205,376,311136,654,44502,277,376
11Oct 2, 2023 01:5716,471208,570,418136,709,39202,269,184
12Oct 2, 2023 01:5716,486197,743,470136,829,66502,260,992