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 5, 2026 09:02Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 09:02015,093,54505,076,0002,121,728expected "53684980413819594 ", got "0*:271/10/98 1*:243/10/93 2*:243/9/92 3*:235/9/87 0 :237/10/88 1 :240/9/87 2 :233/10/87 3 :231/10/84 0 :242/10/84 1 :231/10/85 2 :230/9/84 3 :232/10/85 "
2Oct 5, 2026 09:02015,057,44705,024,0002,121,728expected "53692736409134155 ", got "0*:263/10/95 1*:239/10/92 2*:237/11/90 3*:234/10/87 0 :233/10/88 1 :232/10/86 2 :230/11/84 3 :230/10/85 0 :233/10/82 1 :229/10/84 2 :229/10/83 3 :228/10/84 "
3Oct 5, 2026 09:02015,122,70105,059,0002,121,728expected "53693608757807670 ", got "0*:265/10/97 1*:241/10/94 2*:237/11/90 3*:236/9/89 0 :237/10/88 1 :233/9/87 2 :231/10/86 3 :231/10/86 0 :231/11/85 1 :229/9/83 2 :228/9/83 3 :230/11/84 "