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 listMar 15, 2026 02:49Elijah KinElijah KinScore: 16,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 02:4916,88466,402,30238,191,0004,020,0002,412,544
2Mar 15, 2026 02:4916,91667,077,01440,276,0002,013,0002,301,952
3Mar 15, 2026 02:4917,76272,028,75541,377,0003,027,0002,265,088