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 listDec 29, 2025 16:06Josu San MartinJosu San MartinScore: 27,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0627,42793,075,05563,526,0005,041,0002,363,392
2Dec 29, 2025 16:0627,48390,549,17859,614,0009,093,0002,514,944
3Dec 29, 2025 16:0627,539101,450,35057,872,00010,975,0002,441,216