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 14, 2026 08:08KeefeKeefeScore: 4,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 08:084,46633,068,5297,105,0004,059,0002,441,216
2Mar 14, 2026 08:084,49929,354,1597,158,0004,090,0002,424,832
3Mar 14, 2026 08:084,50224,662,7277,162,0004,092,0002,400,256
4Mar 14, 2026 08:084,50929,552,5457,174,0004,099,0002,457,600
5Mar 14, 2026 08:084,53428,646,5758,243,0003,091,0002,424,832
6Mar 14, 2026 08:084,55028,407,5569,307,0002,068,0002,412,544
7Mar 14, 2026 08:084,58431,582,9858,335,0003,125,0002,428,928
8Mar 14, 2026 08:084,77231,750,1628,948,0002,982,0002,416,640
9Mar 14, 2026 08:084,87636,944,4449,142,0003,047,0002,420,736