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 2, 2022 20:48Xavier R. GuérinXavier R. GuérinScore: 125,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2022 20:5195,179868,206,963789,989,74402,265,088
2Dec 2, 2022 20:5195,189844,904,930790,068,20602,281,472
3Dec 2, 2022 20:5195,214857,865,658790,280,23602,265,088
4Dec 2, 2022 20:51101,562903,827,661842,967,81402,252,800
5Dec 2, 2022 20:51101,629906,116,162843,522,53902,265,088
6Dec 2, 2022 20:51101,779910,877,195844,765,65702,265,088
7Dec 2, 2022 20:48125,4091,099,634,1741,040,895,17302,265,088
8Dec 2, 2022 20:48125,4451,101,541,9451,041,194,10302,273,280
9Dec 2, 2022 20:48125,6991,101,339,5811,043,297,92602,269,184
10Dec 2, 2022 20:482,235,19318,642,254,49418,552,098,18702,265,088
11Dec 2, 2022 20:482,236,67018,631,511,86918,564,356,90702,260,992
12Dec 2, 2022 20:482,241,67718,664,860,50518,605,921,48802,265,088