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 listMar 4, 2026 20:06olliecrowolliecrowScore: 14,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:0614,00758,777,16831,016,0004,002,0002,400,256
2Mar 4, 2026 20:0614,01060,579,26332,023,0003,002,0002,387,968
3Mar 4, 2026 20:0614,01763,736,15832,040,0003,003,0002,387,968
4Mar 4, 2026 20:0614,04066,605,01029,084,0006,017,0002,400,256
5Mar 4, 2026 20:0614,05558,912,88930,118,0005,019,0002,478,080
6Mar 4, 2026 20:0614,06064,738,01830,128,0005,021,0002,392,064
7Mar 4, 2026 20:0614,08059,094,24631,178,0004,023,0002,387,968
8Mar 4, 2026 20:0614,20963,596,37429,434,0006,089,0002,387,968
9Mar 4, 2026 20:0614,24456,449,75331,541,0004,069,0002,412,544