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 listMay 19, 2021 18:58Yuriy LyfenkoYuriy LyfenkoScore: 43,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 18:5843,3276,551,015,629359,617,32002,273,280
2May 19, 2021 18:5843,3554,076,264,679359,849,51702,281,472
3May 19, 2021 18:5843,3615,020,918,265359,893,28902,285,568