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 23:58Victor MerckléVictor MerckléScore: 2,777Success
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 00:002,68416,020,4535,403,0001,309,0002,113,536
2May 30, 2026 00:002,68416,406,6855,403,0001,308,0002,113,536
3May 30, 2026 00:002,77016,563,1825,620,0001,305,0002,113,536
4May 30, 2026 00:002,77217,781,9655,621,0001,309,0002,113,536
5May 30, 2026 00:002,77716,378,0785,638,0001,306,0002,113,536
6May 30, 2026 00:002,80015,061,5155,679,0001,323,0002,113,536
7May 30, 2026 00:002,80516,654,2225,689,0001,324,0002,113,536
8May 30, 2026 00:002,81716,246,7755,712,0001,332,0002,113,536
9May 30, 2026 00:002,83316,682,9074,802,0002,281,0002,113,536