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 22:34Victor MerckléVictor MerckléScore: 2,572Success
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 22:362,52614,074,9424,987,0001,328,0002,113,536
2May 29, 2026 22:362,52715,459,1524,989,0001,329,0002,113,536
3May 29, 2026 22:362,53315,316,0455,004,0001,330,0002,113,536
4May 29, 2026 22:362,53814,165,1375,018,0001,329,0002,113,536
5May 29, 2026 22:362,57215,726,4615,080,0001,351,0002,113,536
6May 29, 2026 22:362,58314,286,5185,125,0001,334,0002,113,536
7May 29, 2026 22:362,59215,445,8295,150,0001,330,0002,113,536
8May 29, 2026 22:362,60514,469,6374,244,0002,269,0002,113,536
9May 29, 2026 22:362,65215,532,2895,289,0001,343,0002,113,536