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 12:32Victor MerckléVictor MerckléScore: 2,222Success
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 12:342,14913,057,4894,129,0001,245,0002,113,536
2Jun 2, 2026 12:342,15113,065,6414,135,0001,243,0002,113,536
3Jun 2, 2026 12:342,18113,128,4794,185,0001,268,0002,113,536
4Jun 2, 2026 12:342,20413,181,4264,232,0001,279,0002,113,536
5Jun 2, 2026 12:342,22213,154,4794,316,0001,240,0002,113,536
6Jun 2, 2026 12:342,22313,181,2544,314,0001,245,0002,113,536
7Jun 2, 2026 12:342,22913,747,2004,326,0001,248,0002,113,536
8Jun 2, 2026 12:342,23213,170,0634,328,0001,252,0002,113,536
9Jun 2, 2026 12:342,26713,284,4964,396,0001,272,0002,113,536