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:16Yuriy 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:1600000Error: expected "53692953338981262 ", got "4 49 511 5104 6509 4 40 398 3996 5100 4 41 403 3993 5089 4 41 418 4175 5319 4 40 417 4189 5343 4 44 422 538 42 423 543 53 537 5341 6818 39 421 530 531 5323 6840 4191 5325 531 5323 6840 53 537 5341 6818 3301 41...