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 16, 2026 23:15M-RochatM-RochatScore: 4,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:154,41219,664,3769,960,0001,072,0002,117,632
2May 16, 2026 23:154,41520,544,3319,967,0001,072,0002,121,728
3May 16, 2026 23:154,41722,464,5909,971,0001,073,0002,117,632
4May 16, 2026 23:154,42119,751,1739,981,0001,073,0002,117,632
5May 16, 2026 23:154,43220,246,60810,004,0001,077,0002,117,632
6May 16, 2026 23:154,43219,670,56110,009,0001,072,0002,117,632
7May 16, 2026 23:154,43319,754,69710,009,0001,074,0002,117,632
8May 16, 2026 23:154,44019,802,58510,026,0001,075,0002,121,728
9May 16, 2026 23:154,46019,851,34910,069,0001,083,0002,121,728