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 29, 2022 22:40Alexander KimAlexander KimScore: 25,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2022 22:4025,440237,232,883208,151,0003,002,0002,326,528
2Dec 29, 2022 22:4025,452235,406,621210,245,0001,005,0002,473,984
3Dec 29, 2022 22:4025,454236,925,410209,263,0002,002,0002,326,528
4Dec 29, 2022 22:4025,456282,305,861211,281,25302,285,568
5Dec 29, 2022 22:4025,456233,816,337208,280,0003,004,0002,473,984
6Dec 29, 2022 22:4025,467233,991,705209,375,0002,003,0002,363,392
7Dec 29, 2022 22:4025,468231,324,536208,382,0003,005,0002,539,520
8Dec 29, 2022 22:4025,470238,764,188210,401,0001,001,0002,359,296
9Dec 29, 2022 22:4025,475270,753,412211,439,95202,277,376
10Dec 29, 2022 22:4025,477235,520,551209,459,0002,004,0002,326,528
11Dec 29, 2022 22:4025,485277,297,417211,525,48602,293,760
12Dec 29, 2022 22:4025,514242,542,590210,770,000998,0002,473,984