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 4, 2026 11:01Victor MerckléVictor MerckléScore: 118,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 11:01118,012312,026,185291,993,0003,038,0002,494,464stderr
2May 4, 2026 11:01118,022312,774,516291,972,0003,084,0002,502,656stderr
3May 4, 2026 11:01118,029312,109,340291,976,0003,097,0002,486,272stderr
4May 4, 2026 11:01118,029310,280,633291,975,0003,098,0002,494,464stderr
5May 4, 2026 11:01118,052312,701,981292,074,0003,057,0002,498,560stderr
6May 4, 2026 11:01118,060313,146,162292,068,0003,083,0002,486,272stderr
7May 4, 2026 11:01118,075314,588,140292,180,0003,009,0002,486,272stderr
8May 4, 2026 11:01118,122312,995,220292,230,0003,075,0002,494,464stderr
9May 4, 2026 11:01118,767315,249,148293,806,0003,112,0002,506,752stderr