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 3, 2026 22:19Elijah KinElijah KinScore: 6,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 22:226,24624,679,49814,556,0001,060,0002,117,632
2Jun 3, 2026 22:226,25824,658,64614,588,0001,057,0002,117,632
3Jun 3, 2026 22:226,25924,639,20714,588,0001,060,0002,117,632
4Jun 3, 2026 22:226,28524,829,11614,655,0001,059,0002,117,632
5Jun 3, 2026 22:226,31325,064,95214,722,0001,062,0002,117,632
6Jun 3, 2026 22:226,33425,194,35314,774,0001,062,0002,117,632
7Jun 3, 2026 22:226,41125,456,97114,970,0001,059,0002,117,632
8Jun 3, 2026 22:226,42625,431,40714,949,0001,117,0002,117,632
9Jun 3, 2026 22:226,48825,702,08515,161,0001,059,0002,117,632