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 18:26Karthik 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 18:26038,160,37325,182,0003,729,00020,480expected "53688062167431741 ", got "M0 25000 us s1 "
2Oct 2, 2026 18:26038,065,61825,190,0003,607,00020,480expected "53688190308314681 ", got "M0 25000 us s1 "
3Oct 2, 2026 18:26038,062,10325,185,0003,580,00020,480expected "53684667494185674 ", got "M0 25000 us s1 "