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 listMay 20, 2026 14:31Victor MerckléVictor MerckléScore: 2,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:322,75115,076,0785,540,0001,338,0002,113,536
2May 20, 2026 14:322,75414,710,6195,543,0001,343,0002,113,536
3May 20, 2026 14:322,75617,209,9425,549,0001,342,0002,113,536
4May 20, 2026 14:322,75814,724,9305,554,0001,341,0002,113,536
5May 20, 2026 14:322,75814,547,9215,552,0001,343,0002,113,536
6May 20, 2026 14:322,82617,747,8915,695,0001,372,0002,113,536
7May 20, 2026 14:322,88215,665,7495,871,0001,336,0002,113,536
8May 20, 2026 14:322,93615,084,3865,037,0002,305,0002,113,536
9May 20, 2026 14:322,95217,184,6355,014,0002,366,0002,113,536