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 listDec 29, 2025 17:46KeefeKeefeScore: 22,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 17:4621,94780,939,95151,875,0002,992,0002,260,992
2Dec 29, 2025 17:4622,05877,803,62854,143,0001,002,0002,416,640
3Dec 29, 2025 17:4622,24077,339,43152,569,0003,032,0002,400,256