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 9, 2024 02:26MikeMikeScore: 99,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 02:2698,847851,873,928765,472,00054,962,0002,330,624
2Oct 9, 2024 02:2698,979853,477,443762,559,00058,965,0002,416,640
3Oct 9, 2024 02:2699,089849,822,071763,476,00058,959,0002,478,080
4Oct 9, 2024 02:2699,110846,015,168764,640,00057,972,0002,547,712
5Oct 9, 2024 02:2699,117853,818,306766,690,00055,977,0002,326,528
6Oct 9, 2024 02:2699,191852,058,646762,336,00060,946,0002,326,528
7Oct 9, 2024 02:2699,684855,305,625766,421,00060,954,0002,326,528
8Oct 9, 2024 02:2699,723853,430,662766,727,00060,978,0002,469,888
9Oct 9, 2024 02:2699,872855,075,182769,945,00058,995,0002,330,624