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 16, 2026 19:42Josu San MartinJosu San MartinScore: 9,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 19:429,60454,320,78019,008,0005,002,0002,260,992
2Jan 16, 2026 19:429,63546,463,46520,073,0004,014,0002,355,200
3Jan 16, 2026 19:429,63849,001,47021,084,0003,012,0002,371,584