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 listJun 1, 2026 15:50Victor MerckléVictor MerckléScore: 2,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 15:522,50913,833,5524,943,0001,330,0002,113,536
2Jun 1, 2026 15:522,52113,805,5664,972,0001,332,0002,113,536
3Jun 1, 2026 15:522,52513,861,2554,980,0001,334,0002,113,536
4Jun 1, 2026 15:522,52713,974,9464,980,0001,338,0002,113,536
5Jun 1, 2026 15:522,56614,010,9785,088,0001,327,0002,113,536
6Jun 1, 2026 15:522,60314,256,8605,172,0001,336,0002,113,536
7Jun 1, 2026 15:522,60713,959,7405,187,0001,332,0002,113,536
8Jun 1, 2026 15:522,61414,033,0225,200,0001,335,0002,113,536
9Jun 1, 2026 15:522,62414,066,5725,221,0001,341,0002,113,536