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 16, 2026 23:14M-RochatM-RochatScore: 4,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:144,48319,874,42010,114,0001,094,0002,117,632
2May 16, 2026 23:144,48720,333,49110,116,0001,102,0002,117,632
3May 16, 2026 23:144,48819,908,19510,128,0001,093,0002,117,632
4May 16, 2026 23:144,49719,950,71810,150,0001,094,0002,117,632
5May 16, 2026 23:144,49822,200,27810,151,0001,094,0002,117,632
6May 16, 2026 23:144,50220,269,13410,162,0001,093,0002,113,536
7May 16, 2026 23:144,50519,924,86810,170,0001,093,0002,113,536
8May 16, 2026 23:144,50819,938,05410,177,0001,095,0002,117,632
9May 16, 2026 23:144,51119,941,05610,183,0001,095,0002,117,632