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 23, 2025 04:43Josu San MartinJosu San MartinScore: 290,740Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 04:43290,371754,254,638720,929,0004,999,0002,437,120
2Dec 23, 2025 04:43290,740750,972,780716,853,0009,997,0002,306,048
3Dec 23, 2025 04:43291,387756,030,017721,473,0006,994,0002,486,272