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 21, 2026 18:57Jacob McDanielJacob McDanielScore: 2,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:572,42516,049,5784,930,0001,134,0002,117,632
2May 21, 2026 18:572,45015,449,0754,927,0001,199,0002,117,632
3May 21, 2026 18:572,50815,569,9475,038,0001,234,0002,117,632
4May 21, 2026 18:572,53416,668,5365,089,0001,246,0002,117,632
5May 21, 2026 18:572,56316,050,2545,148,0001,261,0002,117,632
6May 21, 2026 18:572,56617,616,6135,157,0001,258,0002,117,632
7May 21, 2026 18:572,57917,032,5935,171,0001,277,0002,117,632
8May 21, 2026 18:572,58418,703,1275,185,0001,277,0002,117,632
9May 21, 2026 18:572,59417,678,1325,207,0001,279,0002,117,632