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 listOct 20, 2024 21:12gordgordScore: 240,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2024 21:12239,5002,011,600,3011,928,884,00058,965,0002,289,664
2Oct 20, 2024 21:12239,5042,012,616,4161,913,924,00073,958,0002,289,664
3Oct 20, 2024 21:12240,0072,020,711,1501,923,095,00068,967,0002,277,376
4Oct 20, 2024 21:12240,1982,024,431,3451,940,652,00052,990,0002,273,280
5Oct 20, 2024 21:12240,4002,023,991,8111,937,338,00057,980,0002,281,472
6Oct 20, 2024 21:12240,5682,024,380,3281,926,758,00069,954,0002,281,472
7Oct 20, 2024 21:12240,5862,030,734,5471,932,903,00063,963,0002,289,664
8Oct 20, 2024 21:12240,7922,026,947,2771,940,589,00057,987,0002,375,680
9Oct 20, 2024 21:12240,9402,030,378,4751,882,873,000116,930,0002,281,472