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 listDec 29, 2024 21:00Joad NacerJoad NacerScore: 104,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 21:00104,233284,193,891258,578,0002,004,0002,514,944
2Dec 29, 2024 21:00104,390287,649,504257,977,0002,999,0002,473,984
3Dec 29, 2024 21:00104,437284,440,820255,091,0006,002,0002,342,912