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:01Josu San MartinJosu San MartinScore: 27,541Success
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:0127,38693,665,55359,404,0009,061,0002,514,944
2Dec 29, 2025 16:0127,54196,918,75759,872,0008,980,0002,387,968
3Dec 29, 2025 16:0127,54296,818,49557,879,00010,977,0002,527,232