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:27M-RochatM-RochatScore: 4,666Success
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:274,53420,704,81510,247,0001,088,0002,117,632
2May 20, 2026 16:274,54220,621,69410,260,0001,097,0002,117,632
3May 20, 2026 16:274,54220,657,69910,268,0001,089,0002,117,632
4May 20, 2026 16:274,54720,728,55210,278,0001,090,0002,117,632
5May 20, 2026 16:274,66621,813,98710,569,0001,098,0002,117,632
6May 20, 2026 16:274,66821,085,16810,558,0001,114,0002,117,632
7May 20, 2026 16:274,67021,084,95510,576,0001,101,0002,121,728
8May 20, 2026 16:274,67621,549,59810,590,0001,102,0002,121,728
9May 20, 2026 16:274,75421,736,0449,742,0002,144,0002,117,632