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 14, 2026 19:48marko1597marko1597Score: 1,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:161,77012,991,1503,203,0001,224,0002,117,632
2Aug 14, 2026 20:161,82012,742,4913,401,0001,149,0002,117,632
3Aug 14, 2026 20:161,84013,139,3733,381,0001,219,0002,117,632
4Aug 14, 2026 20:161,88913,039,9213,587,0001,137,0002,117,632
5Aug 14, 2026 20:161,90313,089,6983,579,0001,179,0002,117,632
6Aug 14, 2026 20:161,91313,160,8613,501,0001,282,0002,117,632
7Aug 14, 2026 20:161,91312,980,9293,640,0001,144,0002,117,632
8Aug 14, 2026 20:161,91713,009,0003,645,0001,149,0002,117,632
9Aug 14, 2026 20:161,92212,950,6373,622,0001,183,0002,117,632