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 listDec 28, 2022 13:57Robert BurkeRobert BurkeScore: 7,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 13:577,93690,675,08364,870,000998,0002,277,376
2Dec 28, 2022 13:577,93890,246,84064,886,000998,0002,514,944
3Dec 28, 2022 13:577,93888,198,20163,886,0001,996,0002,277,376
4Dec 28, 2022 13:577,94088,701,14564,907,000998,0002,437,120
5Dec 28, 2022 13:577,94193,043,97864,911,000998,0002,424,832
6Dec 28, 2022 13:577,94687,154,43264,955,000999,0002,539,520
7Dec 28, 2022 13:577,94993,321,78464,977,000999,0002,424,832
8Dec 28, 2022 13:577,95787,481,74764,043,0002,001,0002,277,376
9Dec 28, 2022 13:577,95787,310,58364,040,0002,001,0002,277,376
10Dec 28, 2022 13:577,96288,745,20065,080,0001,001,0002,433,024
11Dec 28, 2022 13:577,96389,271,18164,093,0002,002,0002,428,928
12Dec 28, 2022 13:577,97888,088,42764,209,0002,006,0002,539,520
13Dec 28, 2022 13:578,983130,485,12974,560,32602,179,072
14Dec 28, 2022 13:578,993124,617,16574,643,20002,174,976
15Dec 28, 2022 13:579,085139,488,22875,409,32502,170,880