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:00Josu San MartinJosu San MartinScore: 27,554Success
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:0027,30792,230,51861,240,0007,027,0002,330,624
2Dec 29, 2025 16:0027,55493,966,02961,896,0006,988,0002,355,200
3Dec 29, 2025 16:0028,46597,425,09862,143,0009,020,0002,514,944