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 17, 2026 15:34Jacob McDanielJacob McDanielScore: 7,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:347,67728,825,47016,980,0002,214,0002,113,536
2May 17, 2026 15:347,67928,475,06216,972,0002,226,0002,113,536
3May 17, 2026 15:347,78229,389,85417,240,0002,215,0002,113,536
4May 17, 2026 15:347,83032,362,45517,359,0002,217,0002,113,536
5May 17, 2026 15:347,83631,311,55517,315,0002,276,0002,113,536
6May 17, 2026 15:347,89131,735,09817,459,0002,270,0002,113,536
7May 17, 2026 15:347,99031,876,63417,743,0002,234,0002,113,536
8May 17, 2026 15:348,05329,965,42217,931,0002,202,0002,113,536
9May 17, 2026 15:348,07731,255,49217,991,0002,202,0002,113,536