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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 20:4113,08442,778,21029,595,0003,116,0002,117,632
2Jun 13, 2026 20:4113,39642,635,85330,379,0003,112,0002,117,632
3Jun 13, 2026 20:4113,51742,942,18430,686,0003,108,0002,117,632
4Jun 13, 2026 20:4113,55943,055,81329,860,0004,039,0002,117,632
5Jun 13, 2026 20:4113,61843,364,88529,992,0004,054,0002,117,632
6Jun 13, 2026 20:4113,66243,340,23031,049,0003,108,0002,117,632
7Jun 13, 2026 20:4113,71643,512,97830,254,0004,038,0002,117,632
8Jun 13, 2026 20:4113,82644,072,23530,530,0004,036,0002,117,632
9Jun 13, 2026 20:4113,87243,831,61330,653,0004,028,0002,117,632