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 3, 2026 07:33Victor MerckléVictor MerckléScore: 1,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 07:351,72311,921,8333,087,0001,222,0002,113,536
2Jun 3, 2026 07:351,72511,949,6003,088,0001,225,0002,113,536
3Jun 3, 2026 07:351,72712,040,6513,098,0001,220,0002,113,536
4Jun 3, 2026 07:351,72811,966,8223,102,0001,220,0002,113,536
5Jun 3, 2026 07:351,72813,252,2153,098,0001,223,0002,113,536
6Jun 3, 2026 07:351,75112,015,9213,147,0001,232,0002,113,536
7Jun 3, 2026 07:351,77112,098,5673,089,0001,340,0002,113,536
8Jun 3, 2026 07:351,81718,630,4043,298,0001,245,0002,113,536
9Jun 3, 2026 07:351,87412,327,1143,463,0001,223,0002,113,536