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:02Josu San MartinJosu San MartinScore: 27,445Success
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:0227,31594,942,47960,254,0008,033,0002,285,568
2Dec 29, 2025 16:0227,44596,358,00761,549,0007,063,0002,527,232
3Dec 29, 2025 16:0227,97892,568,59063,951,0005,995,0002,355,200