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,418Success
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,30319,484,3569,692,0001,066,0002,117,632
2May 16, 2026 23:154,31228,922,1319,714,0001,067,0002,117,632
3May 16, 2026 23:154,41019,753,2609,954,0001,072,0002,121,728
4May 16, 2026 23:154,41419,547,5899,963,0001,073,0002,117,632
5May 16, 2026 23:154,41819,693,7659,974,0001,072,0002,121,728
6May 16, 2026 23:154,41919,690,1419,976,0001,073,0002,121,728
7May 16, 2026 23:154,42019,761,1319,977,0001,073,0002,117,632
8May 16, 2026 23:154,44519,784,89510,033,0001,080,0002,121,728
9May 16, 2026 23:154,44619,831,37710,040,0001,076,0002,113,536