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:49Joad NacerJoad NacerScore: 1,300,917Success
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:491,300,4943,275,083,3183,250,235,000999,0002,297,856
2Nov 24, 2024 22:491,300,9173,289,520,0443,252,292,00002,306,048
3Nov 24, 2024 22:491,306,2853,295,801,5803,264,713,000999,0002,297,856