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 22:06Josu San MartinJosu San MartinScore: 43,220Success
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 22:0642,716134,531,445100,803,0005,988,0002,465,792
2Jan 1, 2026 22:0643,220138,079,814100,047,0008,003,0002,412,544
3Jan 1, 2026 22:0644,073137,749,578100,166,00010,016,0002,371,584