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:18M-RochatM-RochatScore: 4,562Success
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:184,54920,750,09110,287,0001,087,0002,117,632
2May 20, 2026 16:184,55120,682,95610,291,0001,088,0002,121,728
3May 20, 2026 16:184,55320,678,87910,296,0001,088,0002,121,728
4May 20, 2026 16:184,55520,733,87110,300,0001,088,0002,121,728
5May 20, 2026 16:184,56220,742,31210,316,0001,089,0002,121,728
6May 20, 2026 16:184,66620,853,33610,573,0001,094,0002,121,728
7May 20, 2026 16:184,69021,054,05010,630,0001,096,0002,117,632
8May 20, 2026 16:184,69421,096,76810,638,0001,097,0002,117,632
9May 20, 2026 16:184,72621,700,14910,718,0001,099,0002,117,632