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 10, 2024 19:46zerozeroScore: 1,939,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 19:461,933,22516,077,370,53415,971,798,00073,966,0002,281,472
2Oct 10, 2024 19:461,933,75716,085,700,19415,989,210,00060,977,0002,289,664
3Oct 10, 2024 19:461,939,18616,127,176,24016,024,273,00070,974,0002,289,664
4Oct 10, 2024 19:461,939,94416,141,383,92716,039,573,00061,963,0002,289,664
5Oct 10, 2024 19:461,939,95916,134,384,74216,034,690,00066,969,0002,281,472
6Oct 10, 2024 19:461,940,61616,140,954,72716,034,145,00072,964,0002,269,184
7Oct 10, 2024 19:461,940,93516,144,029,07416,031,793,00077,969,0002,281,472
8Oct 10, 2024 19:461,943,24416,164,712,86816,071,949,00056,975,0002,289,664
9Oct 10, 2024 19:461,955,04916,266,371,16016,168,939,00057,971,0002,281,472