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 listJan 1, 2026 19:17Josu San MartinJosu San MartinScore: 18,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 19:1718,29375,433,16740,652,0005,081,0002,510,848
2Jan 1, 2026 19:1718,36872,297,31642,859,0003,061,0002,289,664
3Jan 1, 2026 19:1718,40570,106,91141,012,0005,001,0002,490,368