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 4, 2026 00:45Elijah KinElijah KinScore: 3,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 00:483,02316,570,3916,411,0001,148,0002,117,632
2Jun 4, 2026 00:483,03616,642,0506,422,0001,169,0002,117,632
3Jun 4, 2026 00:483,03618,191,5486,423,0001,168,0002,117,632
4Jun 4, 2026 00:483,05716,652,9726,466,0001,177,0002,117,632
5Jun 4, 2026 00:483,05816,693,9906,460,0001,185,0002,117,632
6Jun 4, 2026 00:483,12216,862,4756,617,0001,188,0002,117,632
7Jun 4, 2026 00:483,12816,845,8206,705,0001,116,0002,117,632
8Jun 4, 2026 00:483,15617,436,5006,775,0001,117,0002,117,632
9Jun 4, 2026 00:483,30217,779,6077,108,0001,149,0002,117,632