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:43Josu San MartinJosu San MartinScore: 6,764Success
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:436,69231,837,18512,548,0004,182,0002,473,984
2Feb 5, 2026 03:436,76440,882,71514,921,0001,989,0002,400,256
3Feb 5, 2026 03:436,79244,040,67714,984,0001,997,0002,404,352