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:57Josu San MartinJosu San MartinScore: 27,460Success
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:5727,45893,964,43359,559,0009,085,0002,506,752
2Dec 29, 2025 15:5727,46097,212,01158,556,00010,095,0002,519,040
3Dec 29, 2025 15:5729,39896,593,21366,448,0007,047,0002,514,944