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 11:32Karthik 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 11:3201,390,119,7111,335,496,00045,522,0002,113,536expected "53686634299131267 ", got "2634 2707 2593 2707 2591 2708 2593 2709 "
2Oct 2, 2026 11:3201,389,737,4461,334,930,00045,559,0002,113,536expected "53685834374461093 ", got "2629 2703 2588 2704 2589 2716 2588 2703 "
3Oct 2, 2026 11:3201,390,836,4071,335,795,00045,875,0002,113,536expected "53678812311078882 ", got "2634 2709 2592 2709 2592 2710 2594 2710 "