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 20, 2026 16:36M-RochatM-RochatScore: 4,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:374,55220,782,72110,291,0001,089,0002,117,632
2May 20, 2026 16:374,55620,747,30310,302,0001,089,0002,121,728
3May 20, 2026 16:374,56020,716,70510,313,0001,087,0002,121,728
4May 20, 2026 16:374,56220,747,08710,312,0001,093,0002,121,728
5May 20, 2026 16:374,56420,758,82810,324,0001,088,0002,117,632
6May 20, 2026 16:374,57020,716,93010,333,0001,092,0002,121,728
7May 20, 2026 16:374,59022,421,32410,381,0001,094,0002,117,632
8May 20, 2026 16:374,68321,074,94010,602,0001,107,0002,117,632
9May 20, 2026 16:374,69021,085,30210,628,0001,098,0002,117,632