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 14, 2026 01:39Victor MerckléVictor MerckléScore: 6,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 01:396,04324,300,89911,883,0003,225,0002,117,632
2Jun 14, 2026 01:396,19724,569,30512,307,0003,187,0002,117,632
3Jun 14, 2026 01:396,25124,817,60512,400,0003,228,0002,117,632
4Jun 14, 2026 01:396,26125,110,48012,452,0003,201,0002,117,632
5Jun 14, 2026 01:396,36825,106,20812,719,0003,203,0002,117,632
6Jun 14, 2026 01:396,38626,702,44412,760,0003,206,0002,117,632
7Jun 14, 2026 01:396,39825,195,20112,781,0003,216,0002,117,632
8Jun 14, 2026 01:396,41125,291,72912,814,0003,214,0002,117,632
9Jun 14, 2026 01:396,43725,296,01512,841,0003,252,0002,117,632