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 16:33Andrey TsvetkovAndrey TsvetkovScore: 78,047Success
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 16:2878,007726,841,504647,460,25102,244,608
2Jan 16, 2022 16:3378,012720,773,988647,499,29902,256,896
3Jan 16, 2022 16:2878,021720,831,748647,573,78902,248,704
4Jan 16, 2022 16:2878,031717,135,711647,659,70202,260,992
5Jan 16, 2022 16:2878,047702,977,428647,789,26602,248,704
6Jan 16, 2022 16:3378,048712,282,862647,798,32602,244,608
7Jan 16, 2022 16:3378,081713,090,558648,075,26902,252,800
8Jan 16, 2022 16:2878,091719,839,127648,153,43702,256,896
9Jan 16, 2022 16:2878,093713,079,800648,172,87202,256,896