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 listSep 24, 2026 08:07wnwnError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 08:080990,354,747980,108,0001,101,0002,113,536expected "53691040436406077 ", got "18446744073709550915 0 53691040436406077 26362571 26381829 9990 10004 10103 10107 10280 10279 10207 10217 10039 10048 9991 9989 "
2Sep 24, 2026 08:080983,864,960973,673,0001,051,0002,113,536expected "53687833024265287 ", got "18446744073709550915 0 53687833024265287 26194258 26197969 10000 10002 10108 10113 10242 10272 10173 10164 10032 10026 9982 9975 "
3Sep 24, 2026 08:080995,174,877985,370,0001,053,0002,113,536expected "53688146184471420 ", got "18446744073709550915 0 53688146184471420 26488657 26500057 10001 9990 10095 10089 10270 10354 10212 10192 10046 10028 9936 9885 "