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:41Karthik 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:4203,702,330,638692,158,0001,178,0002,113,536expected "53686500070242829 ", got " A25882 b429496 b4pf39670 b8pf36829 b16pf39353 c18pf33980 c1825894 A25640 b429467 b4pf39681 b8pf36838 b16pf39361 c18pf33981 c1825904 A25632 b429471 b4pf39678 b8pf36838 b16pf39361 c18pf33986 c1825893 "
2Oct 5, 2026 09:4203,703,158,786693,124,0001,136,0002,113,536expected "53687617415016190 ", got " A25816 b429592 b4pf39711 b8pf36893 b16pf39360 c18pf34048 c1825919 A25645 b429578 b4pf39713 b8pf36897 b16pf39426 c18pf34052 c1825919 A25658 b429572 b4pf39708 b8pf36899 b16pf39365 c18pf34055 c1825930 "
3Oct 5, 2026 09:4203,703,081,917692,983,0001,044,0002,113,536expected "53689368089459384 ", got " A25799 b429842 b4pf39724 b8pf36834 b16pf39440 c18pf34104 c1826002 A25635 b429408 b4pf39648 b8pf36829 b16pf39436 c18pf34094 c1825878 A25615 b429406 b4pf39655 b8pf36864 b16pf39430 c18pf34095 c1825861 "