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 listJun 13, 2026 20:04Victor MerckléVictor MerckléScore: 25,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 20:0524,49170,458,28857,210,0004,018,0002,117,632
2Jun 13, 2026 20:0524,93671,572,85658,320,0004,021,0002,117,632
3Jun 13, 2026 20:0525,15673,334,38658,803,0004,087,0002,117,632
4Jun 13, 2026 20:0525,82274,007,65860,527,0004,030,0002,117,632
5Jun 13, 2026 20:0525,84673,850,64660,594,0004,021,0002,117,632
6Jun 13, 2026 20:0525,87674,352,16560,623,0004,069,0002,117,632
7Jun 13, 2026 20:0525,88373,997,56060,663,0004,046,0002,117,632
8Jun 13, 2026 20:0525,90474,030,48460,649,0004,113,0002,117,632
9Jun 13, 2026 20:0525,93474,059,89260,772,0004,063,0002,117,632