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:33Karthik 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:340242,048,967231,928,0001,110,0002,113,536expected "53691509511831892 ", got "2617 2556!2571 2568 2558!2571 2570 2555!2570 "
2Oct 2, 2026 15:340242,167,781232,126,0001,003,0002,113,536expected "53690653007388763 ", got "2611 2559!2572 2572 2558!2573 2573 2559!2572 "
3Oct 2, 2026 15:340241,934,431231,769,0001,177,0002,113,536expected "53696496035508104 ", got "2640 2550!2563 2567 2552!2564 2568 2564!2563 "