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:45Yuriy LyfenkoYuriy LyfenkoScore: 31,813Success
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:4531,810335,814,480264,024,22202,220,032
2Jan 16, 2022 20:4531,813322,937,530264,050,05202,220,032
3Jan 16, 2022 20:4531,814325,210,682264,055,28302,203,648