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 23, 2024 18:15E SequeiraE SequeiraScore: 16,750,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 18:1516,750,25841,922,698,28041,873,647,0001,998,0002,277,376
2Nov 23, 2024 18:1516,750,29041,931,522,63141,873,726,0001,998,0002,277,376
3Nov 23, 2024 18:1516,753,76341,938,650,57841,882,410,0001,998,0002,277,376