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 20, 2026 13:42Victor MerckléVictor MerckléScore: 2,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 13:442,76816,254,1475,788,0001,132,0002,113,536
2May 20, 2026 13:442,76816,371,7995,789,0001,133,0002,113,536
3May 20, 2026 13:442,77417,731,6315,803,0001,132,0002,113,536
4May 20, 2026 13:442,77615,581,4405,805,0001,135,0002,113,536
5May 20, 2026 13:442,78816,377,3885,829,0001,141,0002,113,536
6May 20, 2026 13:442,78914,874,7605,836,0001,137,0002,113,536
7May 20, 2026 13:442,85215,606,9155,117,0002,015,0002,113,536
8May 20, 2026 13:442,90017,938,3306,110,0001,140,0002,113,536
9May 20, 2026 13:442,90315,039,7276,116,0001,142,0002,113,536