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 listMar 15, 2026 00:41Elijah KinElijah KinScore: 492,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 00:41491,9261,255,543,9211,228,815,000999,0002,441,216
2Mar 15, 2026 00:41492,1461,255,341,3161,228,366,0001,998,0002,289,664
3Mar 15, 2026 00:41492,1921,260,835,5381,228,481,0001,999,0002,301,952
4Mar 15, 2026 00:41492,3361,259,097,7791,229,840,000999,0002,301,952
5Mar 15, 2026 00:41492,3561,258,324,1361,229,892,000999,0002,301,952
6Mar 15, 2026 00:41492,3921,259,902,7901,229,982,000999,0002,322,432
7Mar 15, 2026 00:41492,7081,257,674,8221,231,770,00002,301,952
8Mar 15, 2026 00:41492,7601,259,532,5641,230,900,000999,0002,301,952
9Mar 15, 2026 00:41492,9091,256,687,8091,229,275,0002,998,0002,301,952