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 12, 2022 04:10Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2022 04:1000000Error: expected "53686426254901983 ", got "4 40 400 3986 5077 2 32 330 420 3 33 328 415 4 41 416 4197 5339 41 425 4178 5344 1 1 5 54 540 5332 6788 5 52 530 5311 6773 3 32 331 3276 4164 5 53 537 5333 6819 4 42 417 4208 5346 4 42 424 4199 5325 5 52 527 5...