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 19, 2026 14:17Elijah KinElijah KinScore: 13,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:1712,86743,299,68830,059,0002,109,0002,113,536
2May 19, 2026 14:1713,14243,682,82930,739,0002,118,0002,113,536
3May 19, 2026 14:1713,16844,833,04330,804,0002,118,0002,113,536
4May 19, 2026 14:1713,17744,979,39430,826,0002,117,0002,113,536
5May 19, 2026 14:1713,20144,260,86330,885,0002,118,0002,113,536
6May 19, 2026 14:1713,20342,837,74130,889,0002,119,0002,113,536
7May 19, 2026 14:1713,21343,225,44530,915,0002,118,0002,113,536
8May 19, 2026 14:1713,24643,969,14929,987,0003,130,0002,113,536
9May 19, 2026 14:1713,25744,288,18929,978,0003,165,0002,113,536