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 2, 2026 15:22Karthik 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 2, 2026 15:230246,275,404234,878,0001,004,0002,113,536expected "53682530200012605 ", got "2605 2613!2614!2571 2611!2614!2572 2609!2614! "
2Oct 2, 2026 15:230245,011,064234,907,0001,090,0002,113,536expected "53688087413908122 ", got "2596 2610!2619!2576 2608!2620!2577 2608!2617! "
3Oct 2, 2026 15:230245,481,681234,001,0001,095,0002,113,536expected "53686126079851476 ", got "2593 2601!2605!2564 2600!2606!2564 2600!2607! "