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 15:59Josu San MartinJosu San MartinScore: 27,294Success
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 15:5927,25192,713,14061,114,0007,013,0002,502,656
2Dec 29, 2025 15:5927,29495,404,41160,208,0008,027,0002,527,232
3Dec 29, 2025 15:5928,345100,058,65864,875,0005,988,0002,461,696