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 listJan 1, 2026 22:17Josu San MartinJosu San MartinScore: 18,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 22:1718,22775,180,10740,505,0005,063,0002,473,984
2Jan 1, 2026 22:1718,30075,485,07942,701,0003,050,0002,506,752
3Jan 1, 2026 22:1718,33373,108,79539,855,0005,978,0002,289,664