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 listMay 20, 2026 08:06Jacob McDanielJacob McDanielScore: 2,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 08:062,73016,131,7655,636,0001,190,0002,117,632
2May 20, 2026 08:062,74119,267,6875,657,0001,196,0002,117,632
3May 20, 2026 08:062,75817,844,6505,698,0001,198,0002,117,632
4May 20, 2026 08:062,79317,869,6965,735,0001,248,0002,117,632
5May 20, 2026 08:062,80617,927,8995,744,0001,272,0002,117,632
6May 20, 2026 08:062,80817,141,3505,739,0001,283,0002,117,632
7May 20, 2026 08:062,82917,483,1925,797,0001,277,0002,117,632
8May 20, 2026 08:062,83817,399,5595,821,0001,274,0002,117,632
9May 20, 2026 08:062,84517,280,2155,971,0001,142,0002,117,632