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 listJul 2, 2026 10:07A_ShamanA_ShamanScore: 12,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:0712,86341,636,10426,941,0005,218,0002,113,536
2Jul 2, 2026 10:0712,90041,726,44327,049,0005,202,0002,113,536
3Jul 2, 2026 10:0712,91841,761,42027,088,0005,209,0002,113,536
4Jul 2, 2026 10:0712,94141,813,25327,171,0005,183,0002,113,536
5Jul 2, 2026 10:0712,94641,929,55127,177,0005,190,0002,113,536
6Jul 2, 2026 10:0713,00641,958,64127,529,0004,987,0002,113,536
7Jul 2, 2026 10:0713,08442,190,27927,297,0005,413,0002,113,536
8Jul 2, 2026 10:0713,14342,306,54127,650,0005,209,0002,113,536
9Jul 2, 2026 10:0713,17742,527,79227,708,0005,236,0002,113,536