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 listJul 15, 2022 16:50Yuriy LyfenkoYuriy LyfenkoScore: 12,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 16:5012,594158,880,382104,533,61602,244,608
2Jul 15, 2022 16:5012,693131,825,095104,346,0001,003,0002,383,872
3Jul 15, 2022 16:5012,713134,012,229105,516,00002,506,752
4Jul 15, 2022 16:5012,714131,437,641104,523,0001,005,0002,265,088
5Jul 15, 2022 16:5012,718133,986,064105,560,00002,387,968
6Jul 15, 2022 16:5012,903186,203,582107,096,89302,252,800
7Jul 15, 2022 16:5012,915188,027,514107,194,97602,256,896
8Jul 15, 2022 16:5013,157131,704,816108,206,0001,001,0002,379,776
9Jul 15, 2022 16:5013,289133,977,807109,295,0001,002,0002,387,968
10Jul 15, 2022 16:5013,314137,851,292110,505,00002,506,752
11Jul 15, 2022 16:5013,314134,675,432109,499,0001,004,0002,473,984
12Jul 15, 2022 16:5013,315134,691,118109,508,0001,004,0002,265,088