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 19:53Elijah KinElijah KinScore: 2,205Success
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 19:552,02914,126,6873,829,0001,244,0002,117,632
2Jun 9, 2026 19:552,03214,141,7893,831,0001,249,0002,117,632
3Jun 9, 2026 19:552,19614,442,7204,235,0001,255,0002,117,632
4Jun 9, 2026 19:552,20514,535,9664,264,0001,249,0002,117,632
5Jun 9, 2026 19:552,20514,473,4504,256,0001,257,0002,117,632
6Jun 9, 2026 19:552,23714,565,3924,355,0001,239,0002,117,632
7Jun 9, 2026 19:552,30214,735,0214,521,0001,234,0002,117,632
8Jun 9, 2026 19:552,32514,798,6254,557,0001,257,0002,117,632
9Jun 9, 2026 19:552,33314,795,3944,568,0001,266,0002,117,632