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,462Success
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,29493,729,97360,207,0008,027,0002,506,752
2Dec 29, 2025 15:5927,46295,161,50760,579,0008,077,0002,514,944
3Dec 29, 2025 15:5927,55196,427,14260,892,0007,985,0002,314,240