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 6, 2026 06:16Josu San MartinJosu San MartinScore: 3,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 06:163,56623,988,8517,926,000990,0002,457,600
2Feb 6, 2026 06:163,67827,409,1916,130,0003,065,0002,289,664
3Feb 6, 2026 06:163,68924,954,0047,173,0002,049,0002,347,008