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 15:32Tomislav TunkovicTomislav TunkovicScore: 2,033Success
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 15:332,02613,244,3193,787,0001,280,000528,384
2Aug 15, 2026 15:332,02813,461,8133,792,0001,278,000528,384
3Aug 15, 2026 15:332,02914,794,6223,789,0001,285,000528,384
4Aug 15, 2026 15:332,03013,252,5643,786,0001,291,000528,384
5Aug 15, 2026 15:332,03313,315,2543,691,0001,392,000528,384
6Aug 15, 2026 15:332,13913,767,8024,065,0001,283,000528,384
7Aug 15, 2026 15:332,14113,807,1174,075,0001,279,000528,384
8Aug 15, 2026 15:332,15013,549,9524,217,0001,159,000528,384
9Aug 15, 2026 15:332,24014,038,5004,316,0001,284,000528,384