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 29, 2026 09:55Victor MerckléVictor MerckléScore: 2,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 09:562,66414,428,2525,307,0001,355,0002,113,536
2May 29, 2026 09:562,66414,736,2955,306,0001,354,0002,113,536
3May 29, 2026 09:562,69314,828,5015,362,0001,371,0002,113,536
4May 29, 2026 09:562,77215,915,3095,586,0001,346,0002,113,536
5May 29, 2026 09:562,77614,940,2525,592,0001,350,0002,113,536
6May 29, 2026 09:562,77717,231,7015,590,0001,353,0002,113,536
7May 29, 2026 09:562,78215,358,3575,607,0001,349,0002,113,536
8May 29, 2026 09:562,79014,545,8505,596,0001,381,0002,113,536
9May 29, 2026 09:562,81618,271,0225,684,0001,358,0002,113,536