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 20, 2026 16:47M-RochatM-RochatScore: 4,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:474,54920,791,48410,289,0001,085,0002,113,536
2May 20, 2026 16:474,56220,834,55210,318,0001,087,0002,113,536
3May 20, 2026 16:474,56820,769,13710,331,0001,090,0002,117,632
4May 20, 2026 16:474,74821,525,65510,774,0001,097,0002,113,536
5May 20, 2026 16:474,76121,789,84310,807,0001,097,0002,113,536
6May 20, 2026 16:474,76321,304,94710,811,0001,098,0002,113,536
7May 20, 2026 16:474,77222,152,99410,832,0001,099,0002,113,536
8May 20, 2026 16:474,77221,587,34910,833,0001,097,0002,113,536
9May 20, 2026 16:474,78021,857,81110,852,0001,100,0002,121,728