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,432Success
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,39593,695,09260,431,0008,057,0002,314,240
2Dec 29, 2025 16:0127,432102,913,01163,539,0005,042,0002,338,816
3Dec 29, 2025 16:0127,53892,190,22860,864,0007,982,0002,314,240