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 02:31Victor MerckléVictor MerckléScore: 2,332Success
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 02:332,24913,302,3714,393,0001,230,0002,113,536
2Jun 2, 2026 02:332,29513,377,8074,498,0001,240,0002,113,536
3Jun 2, 2026 02:332,32013,456,6874,562,0001,240,0002,113,536
4Jun 2, 2026 02:332,32813,507,8113,719,0002,101,0002,113,536
5Jun 2, 2026 02:332,33213,559,5394,592,0001,240,0002,113,536
6Jun 2, 2026 02:332,35013,578,9574,635,0001,241,0002,113,536
7Jun 2, 2026 02:332,35813,869,0144,653,0001,244,0002,113,536
8Jun 2, 2026 02:332,37013,756,6644,676,0001,251,0002,113,536
9Jun 2, 2026 02:332,38813,878,4084,714,0001,256,0002,113,536