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 listJun 8, 2026 02:32Elijah KinElijah KinScore: 2,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:332,06214,236,2823,915,0001,240,0002,117,632
2Jun 8, 2026 02:332,07014,236,9863,915,0001,260,0002,117,632
3Jun 8, 2026 02:332,07814,243,4553,957,0001,239,0002,117,632
4Jun 8, 2026 02:332,14314,430,2844,225,0001,133,0002,117,632
5Jun 8, 2026 02:332,24014,644,8944,351,0001,250,0002,117,632
6Jun 8, 2026 02:332,24414,698,4514,350,0001,262,0002,117,632
7Jun 8, 2026 02:332,27314,769,7344,410,0001,273,0002,117,632
8Jun 8, 2026 02:332,36415,001,6174,664,0001,247,0002,117,632
9Jun 8, 2026 02:332,39615,101,6054,736,0001,255,0002,117,632