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 listFeb 16, 2024 10:47Huy Duc LeHuy Duc LeScore: 17,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 10:4717,746172,933,289145,285,0002,003,0002,285,568
2Feb 16, 2024 10:4717,750177,539,740145,318,0002,004,0002,285,568
3Feb 16, 2024 10:4717,761167,069,102147,420,00002,527,232
4Feb 16, 2024 10:4717,767168,472,361146,467,0001,003,0002,379,776
5Feb 16, 2024 10:4717,770165,863,523146,489,0001,003,0002,285,568
6Feb 16, 2024 10:4717,773173,739,750146,515,0001,003,0002,260,992
7Feb 16, 2024 10:4717,783176,239,050146,594,0001,004,0002,285,568
8Feb 16, 2024 10:4717,784178,862,826146,603,0001,004,0002,285,568
9Feb 16, 2024 10:4717,803182,215,562145,765,0001,996,0002,265,088
10Feb 16, 2024 10:4718,086215,457,602150,114,62402,293,760
11Feb 16, 2024 10:4718,650224,648,629154,791,50902,281,472
12Feb 16, 2024 10:4718,652234,105,507154,813,90802,289,664