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 listMay 17, 2026 06:39Jacob McDanielJacob McDanielScore: 9,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:399,44433,316,33219,396,0004,215,0002,113,536
2May 17, 2026 06:399,47734,279,19420,252,0003,441,0002,113,536
3May 17, 2026 06:399,48435,019,20919,431,0004,279,0002,113,536
4May 17, 2026 06:399,48532,999,78419,440,0004,273,0002,113,536
5May 17, 2026 06:399,48633,542,69919,438,0004,278,0002,113,536
6May 17, 2026 06:399,50534,522,45219,491,0004,273,0002,113,536
7May 17, 2026 06:399,53634,686,72519,429,0004,411,0002,113,536
8May 17, 2026 06:399,59132,901,31819,419,0004,559,0002,113,536
9May 17, 2026 06:399,61935,864,61319,439,0004,610,0002,113,536