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 10, 2024 23:41Joad NacerJoad NacerScore: 46,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 10, 2024 23:4146,679140,950,679115,692,0001,006,0002,396,160
2Dec 10, 2024 23:4146,758141,438,782111,901,0004,995,0002,355,200
3Dec 10, 2024 23:4147,040140,891,095116,594,0001,005,0002,523,136