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 5, 2026 22:23Elijah KinElijah KinScore: 2,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 22:242,39315,013,7324,877,0001,106,0002,117,632
2Jun 5, 2026 22:242,39615,049,9484,678,0001,313,0002,117,632
3Jun 5, 2026 22:242,53115,390,1925,226,0001,102,0002,117,632
4Jun 5, 2026 22:242,57715,438,2455,336,0001,108,0002,117,632
5Jun 5, 2026 22:242,58715,485,1025,369,0001,099,0002,117,632
6Jun 5, 2026 22:242,58815,482,8065,370,0001,100,0002,117,632
7Jun 5, 2026 22:242,60515,481,9855,418,0001,096,0002,117,632
8Jun 5, 2026 22:242,60615,548,1835,418,0001,099,0002,117,632
9Jun 5, 2026 22:242,66215,696,9985,542,0001,115,0002,117,632