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 16, 2026 22:18Jacob McDanielJacob McDanielScore: 12,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 22:2412,03239,408,99226,645,0003,435,0002,113,536
2May 16, 2026 22:2412,06141,361,01525,826,0004,327,0002,113,536
3May 16, 2026 22:2412,06739,595,88026,722,0003,447,0002,113,536
4May 16, 2026 22:2412,08539,514,94525,980,0004,234,0002,113,536
5May 16, 2026 22:2412,09239,469,64025,921,0004,309,0002,113,536
6May 16, 2026 22:2412,09639,639,27425,951,0004,289,0002,113,536
7May 16, 2026 22:2412,26840,506,81726,270,0004,400,0002,113,536
8May 16, 2026 22:2412,28139,725,98926,258,0004,446,0002,113,536
9May 16, 2026 22:2412,39941,755,76026,436,0004,562,0002,113,536