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 03:00Josu San MartinJosu San MartinScore: 13,360Success
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 03:0013,35255,256,24029,335,0004,046,0002,449,408
2Jan 16, 2026 03:0013,36059,378,84528,340,0005,060,0002,400,256
3Jan 16, 2026 03:0013,39365,565,56831,453,0002,029,0002,396,160