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 15, 2026 22:00Victor MerckléVictor MerckléScore: 1,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 22:031,75011,760,7603,110,0001,266,0002,113,536
2Jun 15, 2026 22:031,81811,974,2423,316,0001,229,0002,113,536
3Jun 15, 2026 22:031,84213,537,3543,353,0001,254,0002,113,536
4Jun 15, 2026 22:031,84412,127,8723,395,0001,216,0002,113,536
5Jun 15, 2026 22:031,85212,045,3683,391,0001,239,0002,113,536
6Jun 15, 2026 22:031,88712,111,4013,489,0001,230,0002,113,536
7Jun 15, 2026 22:031,89012,037,4423,443,0001,284,0002,113,536
8Jun 15, 2026 22:031,89212,076,4093,456,0001,275,0002,113,536
9Jun 15, 2026 22:031,89312,118,0483,508,0001,226,0002,113,536