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:36Karthik 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:3703,524,883,312514,787,0001,212,0002,113,536expected "53684487427999108 ", got " f5:25842 f6:25815 f7:25983 f8:29031 f9:64335 f5:25660 f6:25814 f7:25970 f8:29036 f9:64319 f5:25855 f6:25809 f7:25975 f8:29049 f9:64340 "
2Oct 5, 2026 09:3703,524,080,211514,012,0001,009,0002,113,536expected "53688396252678651 ", got " f5:25903 f6:25727 f7:25859 f8:28936 f9:64372 f5:25640 f6:25715 f7:25875 f8:28918 f9:64438 f5:25647 f6:25731 f7:25874 f8:28931 f9:64316 "
3Oct 5, 2026 09:3703,524,435,255514,270,0001,177,0002,113,536expected "53684965339531449 ", got " f5:25874 f6:25681 f7:26066 f8:28968 f9:64337 f5:25642 f6:25668 f7:26055 f8:28977 f9:64311 f5:25651 f6:25666 f7:26052 f8:28971 f9:64328 "