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:52Joad NacerJoad NacerScore: 34,870Success
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:5234,784118,447,30184,962,0001,999,0002,351,104
2Nov 27, 2024 15:5234,870120,152,30083,167,0004,008,0002,478,080
3Nov 27, 2024 15:5234,950113,611,30885,366,0002,008,0002,392,064