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:31Karthik 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:310270,921,711260,789,0001,086,0002,113,536expected "53685698206903122 ", got "2599 3045 3047 2576 3043 3042 2578 3041 3043 "
2Oct 2, 2026 15:310269,801,594259,722,0001,084,0002,113,536expected "53687827197303258 ", got "2587 3030 3033 2565 3031 3032 2566 3030 3033 "
3Oct 2, 2026 15:310270,478,210260,428,0001,130,0002,113,536expected "53695776798698839 ", got "2602 3039 3040 2573 3039 3041 2573 3037 3041 "