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 11:43Victor MerckléVictor MerckléScore: 2,604Success
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 11:452,50313,813,6184,939,0001,320,0002,113,536
2Jun 1, 2026 11:452,51613,880,8874,962,0001,330,0002,113,536
3Jun 1, 2026 11:452,52413,840,1284,980,0001,330,0002,113,536
4Jun 1, 2026 11:452,54213,960,0185,014,0001,343,0002,113,536
5Jun 1, 2026 11:452,60414,121,7105,195,0001,316,0002,113,536
6Jun 1, 2026 11:452,61414,020,6075,210,0001,327,0002,113,536
7Jun 1, 2026 11:452,61414,040,7555,212,0001,324,0002,113,536
8Jun 1, 2026 11:452,61514,047,5795,211,0001,327,0002,113,536
9Jun 1, 2026 11:452,62414,267,6955,230,0001,330,0002,113,536