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 27, 2024 15:47Joad NacerJoad NacerScore: 40,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 15:4740,468131,996,08699,168,0002,003,0002,506,752
2Nov 27, 2024 15:4740,490133,079,39596,213,0005,011,0002,330,624
3Nov 27, 2024 15:4740,520128,252,68996,287,0005,014,0002,297,856