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 listFeb 5, 2026 22:17Josu San MartinJosu San MartinScore: 5,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 22:175,29931,386,51110,191,0003,057,0002,523,136
2Feb 5, 2026 22:175,30626,130,4209,183,0004,081,0002,392,064
3Feb 5, 2026 22:175,40033,142,61010,386,0003,115,0002,527,232