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 listJan 1, 2023 14:18Vytautas GruslysVytautas GruslysScore: 23,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2023 14:1823,572226,839,336194,645,0001,003,0002,535,424
2Jan 1, 2023 14:1823,785224,101,433196,412,0001,002,0002,281,472
3Jan 1, 2023 14:1823,796218,487,869196,502,0001,002,0002,277,376
4Jan 1, 2023 14:1823,854222,071,549195,986,0001,999,0002,359,296
5Jan 1, 2023 14:1823,856225,818,115197,005,0001,000,0002,281,472
6Jan 1, 2023 14:1823,953225,462,769198,812,00002,269,184
7Jan 1, 2023 14:1823,998227,772,129197,182,0002,001,0002,277,376
8Jan 1, 2023 14:1824,052227,334,488199,629,00002,265,088
9Jan 1, 2023 14:1824,098254,693,432200,010,84002,277,376
10Jan 1, 2023 14:1824,732231,664,729203,270,0002,002,0002,281,472
11Jan 1, 2023 14:1825,473283,678,276211,426,67002,285,568
12Jan 1, 2023 14:1825,485278,969,455211,529,59202,285,568