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:07Karthik 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:070242,959,292232,718,0001,158,0002,113,536expected "53692179905139658 ", got "2639 2573 2575 2571 2577 2574 2569 2571 2573 "
2Oct 2, 2026 15:070242,614,229232,384,0001,171,0002,113,536expected "53687016160491697 ", got "2594 2575 2575 2570 2572 2574 2571 2589 2574 "
3Oct 2, 2026 15:070242,699,784232,528,0001,111,0002,113,536expected "53680429417545288 ", got "2610 2574 2572 2571 2574 2574 2572 2574 2575 "