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 30, 2026 12:12Victor MerckléVictor MerckléScore: 2,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 12:142,53415,629,9944,999,0001,336,0002,113,536
2May 30, 2026 12:142,54214,774,0135,021,0001,336,0002,113,536
3May 30, 2026 12:142,55414,070,7725,039,0001,348,0002,113,536
4May 30, 2026 12:142,60114,215,7005,165,0001,338,0002,113,536
5May 30, 2026 12:142,60816,094,1925,146,0001,375,0002,113,536
6May 30, 2026 12:142,61814,733,7075,211,0001,335,0002,113,536
7May 30, 2026 12:142,64214,176,4965,272,0001,335,0002,113,536
8May 30, 2026 12:142,65817,845,5645,305,0001,341,0002,113,536
9May 30, 2026 12:142,66114,404,0014,362,0002,292,0002,113,536