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 listAug 27, 2026 22:20Elijah KinElijah KinScore: 3,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 22:212,62016,340,5434,403,0002,148,0002,117,632
2Aug 27, 2026 22:213,01617,328,2335,358,0002,183,0002,117,632
3Aug 27, 2026 22:213,04018,009,8275,414,0002,188,0002,117,632
4Aug 27, 2026 22:213,04418,100,2635,403,0002,208,0002,113,536
5Aug 27, 2026 22:213,04418,011,0415,427,0002,185,0002,117,632
6Aug 27, 2026 22:213,04517,377,5875,420,0002,193,0002,117,632
7Aug 27, 2026 22:213,06517,475,0435,476,0002,187,0002,117,632
8Aug 27, 2026 22:213,06617,477,0385,424,0002,242,0002,117,632
9Aug 27, 2026 22:213,10818,166,3475,516,0002,254,0002,117,632