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 listNov 23, 2024 13:56E SequeiraE SequeiraScore: 15,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 13:5615,449151,207,537126,224,0002,003,0002,281,472
2Nov 23, 2024 13:5615,457158,927,151127,295,0001,002,0002,469,888
3Nov 23, 2024 13:5615,459154,228,573127,306,0001,002,0002,289,664
4Nov 23, 2024 13:5615,468151,151,478127,385,0001,003,0002,289,664
5Nov 23, 2024 13:5615,476150,282,694127,448,0001,003,0002,306,048
6Nov 23, 2024 13:5615,477152,694,361127,457,0001,003,0002,306,048
7Nov 23, 2024 13:5615,479151,200,765127,469,0001,003,0002,478,080
8Nov 23, 2024 13:5615,485157,601,020127,521,0001,004,0002,289,664
9Nov 23, 2024 13:5615,492154,901,007127,579,0001,004,0002,289,664