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 listSep 11, 2024 13:12Dmitrii KravchenkoDmitrii KravchenkoScore: 210,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2024 13:12209,3101,760,764,4651,535,355,000201,915,0002,478,080
2Sep 11, 2024 13:12209,6591,762,168,3201,570,250,000169,918,0002,461,696
3Sep 11, 2024 13:12210,0901,772,137,9881,563,873,000179,870,0002,367,488
4Sep 11, 2024 13:12210,1781,771,133,2821,580,619,000163,856,0002,445,312
5Sep 11, 2024 13:12210,2351,774,579,3241,574,054,000170,897,0002,359,296
6Sep 11, 2024 13:12210,2451,772,841,4961,554,138,000190,894,0002,449,408
7Sep 11, 2024 13:12210,3201,770,766,2541,563,793,000181,859,0002,445,312
8Sep 11, 2024 13:12210,5901,772,267,1301,542,027,000205,870,0002,301,952
9Sep 11, 2024 13:12210,9341,773,586,4461,560,888,000189,864,0002,510,848