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 7, 2026 02:55Josu San MartinJosu San MartinScore: 12,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 02:5512,24457,717,05327,549,0003,061,0002,383,872
2Jan 7, 2026 02:5512,35659,983,22121,922,0008,968,0002,502,656
3Jan 7, 2026 02:5512,35657,111,49123,916,0006,975,0002,502,656