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 listAug 15, 2026 15:11Tomislav TunkovicTomislav TunkovicScore: 1,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 15:111,98913,332,7753,840,0001,133,000528,384
2Aug 15, 2026 15:111,99013,176,4983,845,0001,132,000528,384
3Aug 15, 2026 15:111,99513,424,3933,846,0001,143,000528,384
4Aug 15, 2026 15:111,99613,416,7313,854,0001,137,000528,384
5Aug 15, 2026 15:111,99613,199,1223,841,0001,149,000528,384
6Aug 15, 2026 15:112,01013,413,0873,887,0001,140,000528,384
7Aug 15, 2026 15:112,15813,769,6634,237,0001,160,000528,384
8Aug 15, 2026 15:112,17913,921,2234,307,0001,142,000528,384
9Aug 15, 2026 15:112,34614,280,5294,712,0001,155,000528,384