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 29, 2026 08:11Elijah KinElijah KinScore: 8,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 08:138,23831,779,36818,252,0002,345,0002,113,536
2May 29, 2026 08:138,24430,898,34318,276,0002,335,0002,113,536
3May 29, 2026 08:138,30230,014,30218,368,0002,387,0002,113,536
4May 29, 2026 08:138,32829,996,83017,752,0003,070,0002,113,536
5May 29, 2026 08:138,35833,794,42618,759,0002,137,0002,113,536
6May 29, 2026 08:138,39830,267,00618,612,0002,384,0002,113,536
7May 29, 2026 08:138,47830,437,79919,074,0002,121,0002,113,536
8May 29, 2026 08:138,68832,923,69119,605,0002,117,0002,113,536
9May 29, 2026 08:138,71332,333,23618,721,0003,062,0002,113,536