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 1, 2026 12:57Victor MerckléVictor MerckléScore: 23,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 13:0422,72569,168,60149,837,0006,977,0002,494,464
2May 1, 2026 13:0422,88678,529,59149,187,0008,030,0002,473,984
3May 1, 2026 13:0423,14572,173,47949,882,0007,981,0002,543,616
4May 1, 2026 13:0423,16072,505,58149,916,0007,986,0002,486,272
5May 1, 2026 13:0423,22472,050,01651,054,0007,007,0002,494,464
6May 1, 2026 13:0423,26473,571,10451,142,0007,019,0002,482,176
7May 1, 2026 13:0423,28076,631,06951,177,0007,024,0002,486,272
8May 1, 2026 13:0423,31470,462,66353,262,0005,024,0002,486,272
9May 1, 2026 13:0423,39072,742,48553,435,0005,041,0002,478,080