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 9, 2026 03:25Elijah KinElijah KinScore: 2,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 03:262,30014,785,3524,513,0001,237,0002,117,632
2Jun 9, 2026 03:262,31014,827,5624,537,0001,239,0002,117,632
3Jun 9, 2026 03:262,31515,140,9424,540,0001,249,0002,117,632
4Jun 9, 2026 03:262,31715,291,0794,530,0001,264,0002,117,632
5Jun 9, 2026 03:262,33514,865,6564,598,0001,240,0002,117,632
6Jun 9, 2026 03:262,34214,888,7694,606,0001,249,0002,117,632
7Jun 9, 2026 03:262,35015,380,7374,635,0001,242,0002,117,632
8Jun 9, 2026 03:262,35415,562,4094,637,0001,248,0002,117,632
9Jun 9, 2026 03:262,38614,965,2464,708,0001,257,0002,117,632