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 27, 2021 13:56Alexander KimAlexander KimScore: 28,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2021 13:5628,380260,168,013233,550,0002,004,0002,478,080
2Dec 27, 2021 13:5628,387262,956,240232,606,0003,007,0002,486,272
3Dec 27, 2021 13:5628,389264,994,482231,620,0004,010,0002,473,984
4Dec 27, 2021 13:5628,405261,999,020232,767,0002,997,0002,486,272
5Dec 27, 2021 13:5628,407261,029,839232,781,0002,997,0002,478,080
6Dec 27, 2021 13:5628,424258,461,550233,924,0001,999,0002,318,336
7Dec 27, 2021 13:5628,425265,357,023232,926,0002,999,0002,486,272
8Dec 27, 2021 13:5628,432259,948,055233,989,0001,999,0002,318,336
9Dec 27, 2021 13:5628,443262,616,012232,074,0004,001,0002,486,272
10Dec 27, 2021 13:5628,446299,651,092236,101,73902,297,856
11Dec 27, 2021 13:5628,450298,657,619236,136,67002,301,952
12Dec 27, 2021 13:5628,450301,092,758236,138,35202,174,976