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:03Josu San MartinJosu San MartinScore: 27,485Success
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:0327,43892,242,76661,534,0007,061,0002,514,944
2Dec 29, 2025 16:0327,48593,829,06663,660,0005,052,0002,506,752
3Dec 29, 2025 16:0327,60494,296,54861,009,0008,001,0002,514,944