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 23, 2023 15:52Alexander KrivolapovAlexander KrivolapovScore: 19,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2023 15:5219,538224,593,912162,168,74302,342,912
2Dec 23, 2023 15:5219,613220,393,661162,790,32002,228,224
3Dec 23, 2023 15:5219,658226,432,952163,161,90302,224,128
4Dec 23, 2023 15:5219,872193,152,406162,937,0001,999,0002,473,984
5Dec 23, 2023 15:5219,880193,427,050163,000,0002,000,0002,519,040
6Dec 23, 2023 15:5219,880193,054,220163,002,0002,000,0002,306,048
7Dec 23, 2023 15:5219,882189,519,008163,023,0002,000,0002,519,040
8Dec 23, 2023 15:5219,887196,506,895162,059,0003,001,0002,519,040
9Dec 23, 2023 15:5220,047192,486,762165,386,0001,002,0002,482,176
10Dec 23, 2023 15:5220,067194,582,979166,554,00002,519,040
11Dec 23, 2023 15:5220,113193,332,552163,941,0002,998,0002,469,888
12Dec 23, 2023 15:5220,162191,947,537167,348,00002,519,040