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 20, 2026 16:44M-RochatM-RochatScore: 4,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:444,61320,999,76510,426,0001,108,0002,117,632
2May 20, 2026 16:444,61520,984,84210,433,0001,106,0002,121,728
3May 20, 2026 16:444,61820,815,36810,439,0001,108,0002,117,632
4May 20, 2026 16:444,61921,136,99510,443,0001,106,0002,117,632
5May 20, 2026 16:444,62220,861,50410,450,0001,105,0002,121,728
6May 20, 2026 16:444,62520,939,30410,458,0001,106,0002,117,632
7May 20, 2026 16:444,63021,479,6869,536,0002,039,0002,117,632
8May 20, 2026 16:444,63720,880,0679,552,0002,041,0002,117,632
9May 20, 2026 16:444,76521,789,6359,774,0002,140,0002,117,632