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 07:24M-RochatM-RochatScore: 24,588Success
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 07:2824,57770,592,94760,425,0001,018,0002,117,632
2May 16, 2026 07:2824,58070,234,64460,433,0001,018,0002,117,632
3May 16, 2026 07:2824,58170,224,80960,435,0001,018,0002,117,632
4May 16, 2026 07:2824,58370,238,26560,442,0001,017,0002,117,632
5May 16, 2026 07:2824,58870,259,86360,454,0001,018,0002,117,632
6May 16, 2026 07:2824,58870,213,19360,453,0001,018,0002,117,632
7May 16, 2026 07:2824,61670,910,21760,524,0001,018,0002,117,632
8May 16, 2026 07:2824,61770,257,13860,526,0001,017,0002,117,632
9May 16, 2026 07:2824,63070,343,33460,559,0001,018,0002,117,632