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 listJan 16, 2022 20:09Yuriy LyfenkoYuriy LyfenkoScore: 31,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 20:0931,720321,208,965263,278,30002,211,840
2Jan 16, 2022 20:0931,739332,993,819263,430,57002,224,128
3Jan 16, 2022 20:0931,754338,210,710263,558,62302,215,936