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:29Elijah KinElijah KinScore: 14,776Success
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:3514,50045,551,65434,149,0002,102,0002,113,536
2May 19, 2026 14:3514,59245,806,96534,381,0002,100,0002,113,536
3May 19, 2026 14:3514,65247,778,25133,449,0003,182,0002,113,536
4May 19, 2026 14:3514,75949,433,22534,801,0002,098,0002,113,536
5May 19, 2026 14:3514,77647,940,83433,695,0003,247,0002,113,536
6May 19, 2026 14:3514,80848,526,30333,804,0003,217,0002,113,536
7May 19, 2026 14:3514,97849,747,03234,073,0003,373,0002,113,536
8May 19, 2026 14:3515,08860,839,75934,449,0003,272,0002,113,536
9May 19, 2026 14:3519,01356,917,01044,479,0003,055,0002,113,536