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 5, 2026 09:19Karthik 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 5, 2026 09:1903,265,957,719255,747,0001,125,0002,113,536expected "53692857846680587 ", got " A25803 b429495 b829806 A25670 b429484 b829816 A25681 b429485 b829806 "
2Oct 5, 2026 09:1903,266,127,046256,110,0001,006,0002,113,536expected "53685163802042002 ", got " A25835 b429462 b829817 A26101 b429439 b829783 A25687 b429441 b829793 "
3Oct 5, 2026 09:1903,266,919,535256,917,0001,012,0002,113,536expected "53686758877451599 ", got " A25885 b429621 b829947 A25735 b429583 b829955 A25732 b429709 b829954 "