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 17, 2022 00:31Yuriy LyfenkoYuriy LyfenkoScore: 29,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 00:3129,645273,427,058243,053,0003,000,0002,322,432
2Jan 17, 2022 00:3129,649300,603,844246,090,63402,211,840
3Jan 17, 2022 00:3129,651273,506,706243,104,0003,001,0002,523,136
4Jan 17, 2022 00:3129,652310,045,249246,113,87102,224,128
5Jan 17, 2022 00:3129,653267,179,658244,121,0002,000,0002,383,872
6Jan 17, 2022 00:3129,658312,407,528246,159,98602,220,032
7Jan 17, 2022 00:3129,669267,743,709243,247,0003,003,0002,514,944
8Jan 17, 2022 00:3129,672278,838,262244,279,0002,002,0002,527,232
9Jan 17, 2022 00:3129,676266,188,592244,305,0002,002,0002,326,528
10Jan 17, 2022 00:3129,685266,804,920244,385,0002,003,0002,527,232
11Jan 17, 2022 00:3129,686270,899,627244,393,0002,003,0002,322,432
12Jan 17, 2022 00:3129,726272,270,348244,725,0001,997,0002,355,200