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 12:52M-RochatM-RochatScore: 4,372Success
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 12:524,35720,119,9589,818,0001,076,0002,117,632
2May 22, 2026 12:524,36620,115,2919,840,0001,077,0002,117,632
3May 22, 2026 12:524,36720,247,0089,842,0001,077,0002,117,632
4May 22, 2026 12:524,37020,167,1739,852,0001,075,0002,117,632
5May 22, 2026 12:524,37220,177,9649,852,0001,078,0002,117,632
6May 22, 2026 12:524,37520,180,2119,860,0001,079,0002,117,632
7May 22, 2026 12:524,37623,270,1169,863,0001,077,0002,117,632
8May 22, 2026 12:524,38020,219,9359,872,0001,080,0002,117,632
9May 22, 2026 12:524,38120,213,4199,873,0001,081,0002,121,728