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 17, 2026 03:02M-RochatM-RochatScore: 4,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:024,29019,299,9469,665,0001,062,0002,121,728
2May 17, 2026 03:024,30321,749,6369,696,0001,062,0002,121,728
3May 17, 2026 03:024,31019,482,9559,712,0001,065,0002,117,632
4May 17, 2026 03:024,32219,497,9599,738,0001,067,0002,117,632
5May 17, 2026 03:024,40219,741,8149,932,0001,073,0002,121,728
6May 17, 2026 03:024,41319,712,8929,961,0001,072,0002,121,728
7May 17, 2026 03:024,42221,732,0649,983,0001,073,0002,113,536
8May 17, 2026 03:024,42819,684,3349,996,0001,075,0002,117,632
9May 17, 2026 03:024,47819,901,30210,106,0001,089,0002,117,632