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 listJul 16, 2026 18:11Andrew TsibinAndrew TsibinScore: 13,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 18:1113,92044,632,95829,589,0005,212,0002,113,536
2Jul 16, 2026 18:1113,96944,716,74029,579,0005,344,0002,113,536
3Jul 16, 2026 18:1114,08944,940,77729,937,0005,286,0002,113,536