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 29, 2026 10:17Victor MerckléVictor MerckléScore: 2,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 10:182,74916,093,8935,663,0001,210,0002,113,536
2May 29, 2026 10:182,76215,375,3345,543,0001,364,0002,113,536
3May 29, 2026 10:182,78516,359,7375,618,0001,345,0002,113,536
4May 29, 2026 10:182,79015,830,2265,627,0001,349,0002,113,536
5May 29, 2026 10:182,79116,776,9065,631,0001,347,0002,113,536
6May 29, 2026 10:182,79614,720,9455,630,0001,360,0002,113,536
7May 29, 2026 10:182,80914,742,1345,680,0001,344,0002,113,536
8May 29, 2026 10:182,82215,506,1395,686,0001,369,0002,113,536
9May 29, 2026 10:182,82515,536,0115,702,0001,362,0002,113,536