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 16, 2026 23:08Tomislav TunkovicTomislav TunkovicScore: 2,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 02:272,64316,417,3385,513,0001,095,000528,384
2Aug 17, 2026 02:272,64616,450,4195,526,0001,089,000528,384
3Aug 17, 2026 02:272,73916,779,1875,737,0001,112,000528,384
4Aug 17, 2026 02:272,74216,732,7855,770,0001,087,000528,384
5Aug 17, 2026 02:272,78717,540,5615,875,0001,093,000528,384
6Aug 17, 2026 02:272,82617,658,0585,952,0001,115,000528,384
7Aug 17, 2026 02:272,82616,864,2195,974,0001,091,000528,384
8Aug 17, 2026 02:272,84116,939,3985,995,0001,108,000528,384
9Aug 17, 2026 02:272,84517,214,3436,019,0001,095,000528,384