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:53Joad NacerJoad NacerScore: 34,422Success
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:5334,418113,801,15785,044,0001,000,0002,433,024
2Nov 27, 2024 15:5334,422122,435,63385,054,0001,000,0002,437,120
3Nov 27, 2024 15:5334,463119,084,83185,157,0001,001,0002,330,624