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 1, 2026 21:22Victor MerckléVictor MerckléScore: 2,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 21:242,40713,724,8854,796,0001,222,0002,113,536
2Jun 1, 2026 21:242,40913,682,7624,804,0001,219,0002,113,536
3Jun 1, 2026 21:242,42313,736,7444,828,0001,231,0002,113,536
4Jun 1, 2026 21:242,44413,776,0444,874,0001,236,0002,113,536
5Jun 1, 2026 21:242,47613,844,2414,961,0001,231,0002,113,536
6Jun 1, 2026 21:242,49813,816,9305,020,0001,227,0002,113,536
7Jun 1, 2026 21:242,49913,829,5885,026,0001,223,0002,113,536
8Jun 1, 2026 21:242,50213,856,1065,037,0001,220,0002,113,536
9Jun 1, 2026 21:242,50613,882,0655,040,0001,226,0002,113,536