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 23:10Josu San MartinJosu San MartinScore: 5,723Success
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 23:105,68034,716,68512,173,0002,028,0002,527,232
2Feb 5, 2026 23:105,72331,296,74611,242,0003,066,0002,527,232
3Feb 5, 2026 23:105,74038,807,09111,275,0003,075,0002,523,136