Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listSep 3, 2024 16:57AnSaAnSaScore: 1,137,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 16:571,133,9922,862,810,7722,832,983,0001,998,000679,936
2Sep 3, 2024 16:571,134,2392,862,446,2802,833,599,0001,999,000679,936
3Sep 3, 2024 16:571,134,2882,861,655,9732,833,722,0001,999,000851,968
4Sep 3, 2024 16:571,135,2052,868,116,3682,836,015,0001,998,000679,936
5Sep 3, 2024 16:571,137,2682,868,632,0022,843,170,0000675,840
6Sep 3, 2024 16:571,137,4062,871,763,4242,842,516,000999,000679,936
7Sep 3, 2024 16:571,138,5982,872,506,6872,845,496,000999,000675,840
8Sep 3, 2024 16:571,139,1272,878,088,8182,845,819,0001,998,000688,128
9Sep 3, 2024 16:571,140,7182,888,003,4802,849,798,0001,998,000679,936