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 17, 2026 14:20Jacob McDanielJacob McDanielScore: 8,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:308,45632,216,06018,986,0002,155,0002,113,536
2May 17, 2026 14:308,54531,084,73819,219,0002,144,0002,113,536
3May 17, 2026 14:308,56330,511,67219,231,0002,178,0002,113,536
4May 17, 2026 14:308,57931,083,51419,264,0002,185,0002,113,536
5May 17, 2026 14:308,63131,628,21919,373,0002,206,0002,113,536
6May 17, 2026 14:308,63832,209,70119,428,0002,168,0002,113,536
7May 17, 2026 14:308,64431,764,45419,434,0002,178,0002,113,536
8May 17, 2026 14:308,65330,498,75319,476,0002,157,0002,113,536
9May 17, 2026 14:308,83032,735,51219,888,0002,188,0002,113,536