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 05:16Elijah KinElijah KinScore: 2,220Success
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 05:172,02314,203,0953,866,0001,192,0002,117,632
2Jun 9, 2026 05:172,04514,272,4103,903,0001,210,0002,117,632
3Jun 9, 2026 05:172,18314,517,2914,252,0001,207,0002,117,632
4Jun 9, 2026 05:172,21314,633,7874,340,0001,193,0002,117,632
5Jun 9, 2026 05:172,22014,661,4824,337,0001,214,0002,117,632
6Jun 9, 2026 05:172,27014,692,2974,485,0001,192,0002,117,632
7Jun 9, 2026 05:172,33214,914,4464,638,0001,192,0002,117,632
8Jun 9, 2026 05:172,37414,977,4324,728,0001,207,0002,117,632
9Jun 9, 2026 05:172,42415,119,2854,771,0001,290,0002,117,632