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 13:36Victor MerckléVictor MerckléScore: 2,252Success
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 13:382,15813,047,5894,160,0001,236,0002,113,536
2Jun 2, 2026 13:382,16813,135,5014,179,0001,242,0002,113,536
3Jun 2, 2026 13:382,24013,271,2044,356,0001,246,0002,113,536
4Jun 2, 2026 13:382,24713,240,7814,377,0001,242,0002,113,536
5Jun 2, 2026 13:382,25213,511,1814,380,0001,251,0002,113,536
6Jun 2, 2026 13:382,25313,541,3604,388,0001,246,0002,113,536
7Jun 2, 2026 13:382,25813,288,4283,555,0002,091,0002,113,536
8Jun 2, 2026 13:382,27213,279,1294,423,0001,258,0002,113,536
9Jun 2, 2026 13:382,27313,520,8194,423,0001,261,0002,113,536