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:07Jacob McDanielJacob McDanielScore: 2,789Success
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:072,75118,081,1315,643,0001,235,0002,117,632
2May 20, 2026 08:072,77116,218,0385,664,0001,264,0002,117,632
3May 20, 2026 08:072,77217,162,9875,669,0001,262,0002,117,632
4May 20, 2026 08:072,78319,074,9835,689,0001,270,0002,117,632
5May 20, 2026 08:072,78917,975,2975,698,0001,275,0002,117,632
6May 20, 2026 08:072,80817,950,3755,735,0001,286,0002,117,632
7May 20, 2026 08:072,81219,215,5145,758,0001,272,0002,117,632
8May 20, 2026 08:072,81917,053,7605,770,0001,279,0002,117,632
9May 20, 2026 08:072,82017,724,0885,777,0001,274,0002,117,632