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 12, 2026 03:45Victor MerckléVictor MerckléScore: 1,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 03:471,74511,808,1593,152,0001,212,0002,113,536
2Jun 12, 2026 03:471,74711,955,4533,153,0001,216,0002,113,536
3Jun 12, 2026 03:471,79612,107,1413,284,0001,206,0002,113,536
4Jun 12, 2026 03:471,80912,209,4983,261,0001,263,0002,113,536
5Jun 12, 2026 03:471,84812,242,3903,393,0001,229,0002,113,536
6Jun 12, 2026 03:471,86212,145,2403,422,0001,234,0002,113,536
7Jun 12, 2026 03:471,88512,641,2463,492,0001,222,0002,113,536
8Jun 12, 2026 03:471,88512,748,1103,487,0001,226,0002,113,536
9Jun 12, 2026 03:471,90812,400,1833,455,0001,315,0002,113,536