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 listDec 11, 2023 01:37sliceteamsliceteamScore: 12,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2023 01:3712,403126,296,035100,948,0001,998,0002,490,368
2Dec 11, 2023 01:3712,413123,925,347102,026,0001,000,0002,482,176
3Dec 11, 2023 01:3712,417127,755,504101,058,0002,001,0002,494,464
4Dec 11, 2023 01:3712,418128,689,590101,072,0002,001,0002,494,464
5Dec 11, 2023 01:3712,423129,982,595101,105,0002,002,0002,502,656
6Dec 11, 2023 01:3712,433126,428,162100,191,0003,005,0002,502,656
7Dec 11, 2023 01:3712,434126,060,072101,196,0002,003,0002,506,752
8Dec 11, 2023 01:3712,507129,517,109102,810,000998,0002,273,280
9Dec 11, 2023 01:3712,982172,289,578107,754,36602,240,512
10Dec 11, 2023 01:3714,659188,970,355121,672,51402,248,704
11Dec 11, 2023 01:3714,950150,127,405122,087,0002,001,0002,506,752
12Dec 11, 2023 01:3715,053177,062,172124,938,04502,252,800