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 03:55Josu San MartinJosu San MartinScore: 5,777Success
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 03:555,72636,214,1918,180,0006,135,0002,502,656
2Feb 5, 2026 03:555,77727,925,4188,253,0006,190,0002,478,080
3Feb 5, 2026 03:555,95132,060,80410,911,0003,967,0002,322,432