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:58Josu San MartinJosu San MartinScore: 27,539Success
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:5827,44793,271,46562,563,0006,054,0002,510,848
2Dec 29, 2025 15:5827,53993,919,61961,863,0006,984,0002,514,944
3Dec 29, 2025 15:5828,045100,215,65562,100,0008,012,0002,514,944