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 01:36Yuriy LyfenkoYuriy LyfenkoScore: 29,675Success
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 01:3629,658268,491,784245,162,0001,000,0002,527,232
2Jan 17, 2022 01:3629,659319,964,747246,173,57502,215,936
3Jan 17, 2022 01:3629,659308,703,487246,172,21202,211,840
4Jan 17, 2022 01:3629,668309,329,163246,241,26702,220,032
5Jan 17, 2022 01:3629,668269,872,003243,242,0003,002,0002,326,528
6Jan 17, 2022 01:3629,675269,825,205244,289,0002,010,0002,326,528
7Jan 17, 2022 01:3629,675268,602,885244,301,0002,002,0002,326,528
8Jan 17, 2022 01:3629,681268,978,963244,352,0002,002,0002,326,528
9Jan 17, 2022 01:3629,688269,412,076245,411,0001,001,0002,523,136
10Jan 17, 2022 01:3629,697275,127,415244,480,0002,003,0002,326,528
11Jan 17, 2022 01:3629,701272,310,948244,516,0002,004,0002,326,528
12Jan 17, 2022 01:3629,706278,136,102245,560,0001,002,0002,326,528