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 21:41Victor MerckléVictor MerckléScore: 1,822Success
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 21:431,72413,608,7813,096,0001,216,0002,113,536
2Jun 2, 2026 21:431,72611,995,7613,100,0001,217,0002,113,536
3Jun 2, 2026 21:431,73211,958,0093,111,0001,219,0002,113,536
4Jun 2, 2026 21:431,73813,661,7573,124,0001,222,0002,113,536
5Jun 2, 2026 21:431,82212,196,2483,332,0001,223,0002,113,536
6Jun 2, 2026 21:431,82812,673,2493,350,0001,221,0002,113,536
7Jun 2, 2026 21:431,87812,322,2983,476,0001,219,0002,113,536
8Jun 2, 2026 21:431,88112,334,7423,480,0001,223,0002,113,536
9Jun 2, 2026 21:431,88612,742,2503,490,0001,226,0002,113,536