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 30, 2022 01:52Victor MuñozVictor MuñozScore: 31,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 30, 2022 01:5229,825311,748,167247,545,00702,260,992
2Dec 30, 2022 01:5229,898312,346,002248,155,53302,269,184
3Dec 30, 2022 01:5230,024305,761,127249,196,55502,269,184
4Dec 30, 2022 01:5231,143284,425,462257,491,000998,0002,392,064
5Dec 30, 2022 01:5231,213289,150,791258,070,0001,000,0002,265,088
6Dec 30, 2022 01:5231,219287,274,513257,117,0002,000,0002,383,872
7Dec 30, 2022 01:5231,237288,888,067258,267,0001,001,0002,383,872
8Dec 30, 2022 01:5231,238286,288,638258,272,0001,001,0002,265,088
9Dec 30, 2022 01:5231,256282,418,017259,421,00002,527,232
10Dec 30, 2022 01:5231,261284,555,795258,467,000997,0002,383,872
11Dec 30, 2022 01:5231,294293,488,657259,737,00002,265,088
12Dec 30, 2022 01:5231,294289,350,512257,742,0001,998,0002,387,968