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 6, 2026 22:28Elijah KinElijah KinScore: 2,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 22:292,31014,793,9134,660,0001,115,0002,117,632
2Jun 6, 2026 22:292,31414,838,1184,668,0001,118,0002,117,632
3Jun 6, 2026 22:292,31414,776,1294,667,0001,120,0002,117,632
4Jun 6, 2026 22:292,32214,808,3974,685,0001,121,0002,117,632
5Jun 6, 2026 22:292,32414,830,8384,688,0001,122,0002,117,632
6Jun 6, 2026 22:292,33314,876,2644,717,0001,117,0002,117,632
7Jun 6, 2026 22:292,33814,817,2684,729,0001,117,0002,117,632
8Jun 6, 2026 22:292,39815,066,9744,756,0001,239,0002,117,632
9Jun 6, 2026 22:292,55315,406,0995,270,0001,113,0002,117,632