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 25, 2021 04:09Yuriy LyfenkoYuriy LyfenkoScore: 37,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2021 04:0937,402371,670,293310,439,48302,265,088
2Oct 25, 2021 04:0937,436376,686,880310,716,31602,252,800
3Oct 25, 2021 04:0937,454379,021,082310,872,14102,260,992