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:47Alexander KrivolapovAlexander KrivolapovScore: 20,237Success
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:4719,745235,722,805163,885,95002,195,456
2Dec 23, 2023 15:4719,748230,147,708163,906,25102,187,264
3Dec 23, 2023 15:4720,138238,879,458167,143,13202,318,336
4Dec 23, 2023 15:4720,208191,730,373166,729,000998,0002,568,192
5Dec 23, 2023 15:4720,213198,231,648166,773,000998,0002,551,808
6Dec 23, 2023 15:4720,229198,706,264165,903,0001,998,0002,560,000
7Dec 23, 2023 15:4720,237199,146,454165,969,0001,999,0002,387,968
8Dec 23, 2023 15:4720,241195,501,310166,003,0002,000,0002,560,000
9Dec 23, 2023 15:4720,242194,657,639167,011,0001,000,0002,387,968
10Dec 23, 2023 15:4720,248198,653,799167,062,0001,000,0002,555,904
11Dec 23, 2023 15:4720,258208,388,440167,144,0001,000,0002,568,192
12Dec 23, 2023 15:4720,267195,578,003166,213,0002,002,0002,387,968