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 listMay 17, 2026 23:22M-RochatM-RochatScore: 4,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 23:224,55920,694,49710,309,0001,089,0002,121,728
2May 17, 2026 23:224,57120,684,78110,338,0001,091,0002,117,632
3May 17, 2026 23:224,57722,383,33810,353,0001,090,0002,117,632
4May 17, 2026 23:224,66820,852,48210,574,0001,098,0002,117,632
5May 17, 2026 23:224,68121,199,09910,605,0001,099,0002,121,728
6May 17, 2026 23:224,68321,109,13710,612,0001,096,0002,121,728
7May 17, 2026 23:224,69921,166,54310,649,0001,099,0002,117,632
8May 17, 2026 23:224,70721,519,73810,668,0001,100,0002,117,632
9May 17, 2026 23:224,72121,213,78510,703,0001,101,0002,117,632