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 18, 2026 05:42Jacob McDanielJacob McDanielScore: 3,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 05:483,22120,142,9896,846,0001,207,0002,117,632
2May 18, 2026 05:483,29320,446,6556,998,0001,235,0002,117,632
3May 18, 2026 05:483,29420,250,0256,959,0001,276,0002,117,632
4May 18, 2026 05:483,30617,461,4896,991,0001,274,0002,117,632
5May 18, 2026 05:483,31819,001,7357,024,0001,272,0002,117,632
6May 18, 2026 05:483,33518,298,0897,068,0001,271,0002,117,632
7May 18, 2026 05:483,33718,525,9297,064,0001,279,0002,117,632
8May 18, 2026 05:483,35119,527,9777,108,0001,270,0002,117,632
9May 18, 2026 05:483,35917,562,5657,123,0001,275,0002,117,632