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 listMay 27, 2024 16:11Joad NacerJoad NacerScore: 1,188,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 16:111,184,2153,016,919,1872,960,537,43002,297,856
2May 27, 2024 16:111,188,2013,052,235,6342,970,502,41802,293,760
3May 27, 2024 16:111,192,2233,032,660,9102,980,556,92302,281,472