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 27, 2026 18:33Elijah KinElijah KinScore: 6,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2026 18:346,03427,710,50311,763,0003,324,0002,113,536
2May 27, 2026 18:346,14926,551,85212,016,0003,358,0002,113,536
3May 27, 2026 18:346,19624,663,47512,204,0003,288,0002,113,536
4May 27, 2026 18:346,22027,969,63512,214,0003,336,0002,113,536
5May 27, 2026 18:346,28726,835,82812,274,0003,445,0002,113,536
6May 27, 2026 18:346,30625,684,63612,292,0003,475,0002,117,632
7May 27, 2026 18:346,40227,382,80112,569,0003,437,0002,113,536
8May 27, 2026 18:346,41227,662,45712,753,0003,278,0002,113,536
9May 27, 2026 18:346,42927,477,25012,712,0003,361,0002,113,536