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 16, 2026 06:15Victor MerckléVictor MerckléScore: 1,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 06:181,71011,637,5813,071,0001,205,0002,113,536
2Jun 16, 2026 06:181,71211,512,3063,075,0001,206,0002,113,536
3Jun 16, 2026 06:181,72411,662,3303,099,0001,213,0002,113,536
4Jun 16, 2026 06:181,73111,716,6433,105,0001,223,0002,113,536
5Jun 16, 2026 06:181,76311,842,9773,194,0001,214,0002,113,536
6Jun 16, 2026 06:181,76711,790,8883,078,0001,341,0002,113,536
7Jun 16, 2026 06:181,81811,912,9023,165,0001,382,0002,113,536
8Jun 16, 2026 06:181,85212,047,1733,422,0001,209,0002,113,536
9Jun 16, 2026 06:181,87012,026,3733,471,0001,205,0002,113,536