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 listFeb 5, 2026 04:46Josu San MartinJosu San MartinScore: 5,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:465,49229,330,01111,619,0002,112,0002,527,232
2Feb 5, 2026 04:465,63730,005,78610,066,0004,026,0002,527,232
3Feb 5, 2026 04:465,70436,194,84810,185,0004,074,0002,527,232