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 2, 2026 07:11Victor MerckléVictor MerckléScore: 2,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 07:132,13212,964,5404,087,0001,243,0002,113,536
2Jun 2, 2026 07:132,13612,935,4974,098,0001,242,0002,113,536
3Jun 2, 2026 07:132,14213,046,3864,107,0001,248,0002,113,536
4Jun 2, 2026 07:132,14213,006,2634,106,0001,250,0002,113,536
5Jun 2, 2026 07:132,20813,097,7124,271,0001,250,0002,113,536
6Jun 2, 2026 07:132,20913,129,1444,255,0001,269,0002,113,536
7Jun 2, 2026 07:132,21713,264,9414,299,0001,245,0002,113,536
8Jun 2, 2026 07:132,23813,228,0704,316,0001,279,0002,113,536
9Jun 2, 2026 07:132,25213,475,5864,363,0001,268,0002,113,536