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 listAug 15, 2026 10:30Tomislav TunkovicTomislav TunkovicScore: 2,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 10:312,03413,224,9444,028,0001,057,0002,117,632
2Aug 15, 2026 10:312,03813,585,7634,041,0001,055,0002,117,632
3Aug 15, 2026 10:312,04713,324,7244,041,0001,077,0002,117,632
4Aug 15, 2026 10:312,05313,527,1054,063,0001,070,0002,117,632
5Aug 15, 2026 10:312,05413,528,2214,070,0001,066,0002,117,632
6Aug 15, 2026 10:312,19313,741,6124,401,0001,083,0002,117,632
7Aug 15, 2026 10:312,20713,920,1144,447,0001,071,0002,117,632
8Aug 15, 2026 10:312,21413,994,4164,464,0001,073,0002,117,632
9Aug 15, 2026 10:312,23413,743,1864,496,0001,090,0002,117,632