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 listNov 24, 2024 22:48Joad NacerJoad NacerScore: 1,300,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 22:481,300,5823,280,522,3453,249,456,0001,999,0002,297,856
2Nov 24, 2024 22:481,300,9413,277,718,2113,251,353,000999,0002,289,664
3Nov 24, 2024 22:481,301,5813,282,954,4993,251,955,0001,998,0002,400,256