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 17:48Victor MerckléVictor MerckléScore: 2,654Success
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 17:502,58814,173,1205,159,0001,313,0002,113,536
2May 29, 2026 17:502,59815,643,8035,182,0001,314,0002,113,536
3May 29, 2026 17:502,60816,051,4685,194,0001,326,0002,113,536
4May 29, 2026 17:502,64514,529,7105,269,0001,344,0002,113,536
5May 29, 2026 17:502,65414,858,1205,294,0001,343,0002,113,536
6May 29, 2026 17:502,70514,717,7785,455,0001,308,0002,113,536
7May 29, 2026 17:502,70716,341,7305,454,0001,315,0002,113,536
8May 29, 2026 17:502,71715,467,6745,483,0001,310,0002,113,536
9May 29, 2026 17:502,71916,886,4715,490,0001,308,0002,113,536