O(n) Stress Test 1 Series Sum

Points 100 8.0s 256M

You are given two positive integers \(l\) and \(r\) with \(l \le r\). Compute the sum of the \(r - l + 1\) integers \(l, l+1, \ldots, r\) modulo \(2^{64}\).

Input

The input consists of two integers \(l\) and \(r\) (\(1 \le l \le r \le 10^{10}\)).

Output

Output a single integer representing the required value.

Sample Input 1

1 100

Sample Output 1

5050

Sample Input 2

1 10000000000

Sample Output 2

13106511857580896768

Problem page help

Keyboard shortcuts

Main features

  • Sample tests — Runs the sample cases bundled with the problem and auto-compares against the expected output.
  • Custom test — Run your code with your own stdin. Optionally tick the "Compare with expected (diff)" box to verify against expected output line-by-line.
  • Template — Paste the default code template you set on your profile page.
  • Collab — Edit this problem together with classmates in real time.
  • Auto-draft — Editor contents auto-save to your browser every 1.5 seconds (per account / problem / language).
  • Submit — Send your code to the judge for grading; returns AC / WA / TLE etc.

Limits

  • Source code: at most 65,536 characters
  • Custom test stdin and expected output: at most 1 MB each (≈1 million characters)
  • Custom test and sample test share the sandbox; about 1 request per 3 s per user (sample test: 1 per 1 s)
  • Custom test and sample test both have a 15 second wall-clock cap (the official judge still uses the problem time limit)
  • Interactive problems do not offer custom test (cannot simulate interaction with the judge).
  • Submitting has no rate limit, but rapid repeated submissions on the same problem are treated as score farming.