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 22, 2026 13:09M-RochatM-RochatScore: 4,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 13:094,29519,940,6609,365,0001,373,0002,113,536
2May 22, 2026 13:094,29620,157,1369,369,0001,371,0002,113,536
3May 22, 2026 13:094,30219,932,1729,693,0001,063,0002,113,536
4May 22, 2026 13:094,30520,804,7589,701,0001,063,0002,113,536
5May 22, 2026 13:094,30720,308,2329,395,0001,374,0002,117,632
6May 22, 2026 13:094,31619,976,8779,416,0001,374,0002,121,728
7May 22, 2026 13:094,32220,047,9179,740,0001,065,0002,113,536
8May 22, 2026 13:094,32420,102,8279,747,0001,064,0002,113,536
9May 22, 2026 13:094,34720,053,1979,805,0001,063,0002,117,632