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 30, 2026 01:01Victor MerckléVictor MerckléScore: 2,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 01:032,53014,685,4144,994,0001,332,0002,113,536
2May 30, 2026 01:032,53714,246,2425,014,0001,329,0002,113,536
3May 30, 2026 01:032,54015,367,1915,020,0001,330,0002,113,536
4May 30, 2026 01:032,54314,131,4405,026,0001,333,0002,113,536
5May 30, 2026 01:032,61414,235,7885,210,0001,325,0002,113,536
6May 30, 2026 01:032,61716,429,2405,178,0001,366,0002,113,536
7May 30, 2026 01:032,61816,101,3705,221,0001,325,0002,113,536
8May 30, 2026 01:032,62116,639,7285,226,0001,328,0002,113,536
9May 30, 2026 01:032,69314,480,2454,457,0002,277,0002,113,536