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 8, 2026 02:54Elijah KinElijah KinScore: 2,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:552,04114,134,7733,880,0001,223,0002,117,632
2Jun 8, 2026 02:552,05114,194,2943,892,0001,237,0002,117,632
3Jun 8, 2026 02:552,07314,245,9533,916,0001,267,0002,117,632
4Jun 8, 2026 02:552,07514,267,3763,924,0001,264,0002,117,632
5Jun 8, 2026 02:552,07914,272,9183,918,0001,280,0002,117,632
6Jun 8, 2026 02:552,29916,174,8174,480,0001,268,0002,117,632
7Jun 8, 2026 02:552,36215,044,6294,649,0001,256,0002,117,632
8Jun 8, 2026 02:552,36816,599,3544,667,0001,253,0002,117,632
9Jun 8, 2026 02:552,39115,037,9454,733,0001,246,0002,117,632