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 02:39Elijah KinElijah KinScore: 2,266Success
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 02:402,06514,187,1543,947,0001,217,0002,117,632
2Jun 9, 2026 02:402,07514,290,8893,958,0001,231,0002,117,632
3Jun 9, 2026 02:402,08014,366,9053,964,0001,238,0002,117,632
4Jun 9, 2026 02:402,14814,502,3344,253,0001,118,0002,117,632
5Jun 9, 2026 02:402,26614,781,8404,407,0001,258,0002,117,632
6Jun 9, 2026 02:402,28714,804,3754,462,0001,256,0002,117,632
7Jun 9, 2026 02:402,32214,881,5054,565,0001,241,0002,117,632
8Jun 9, 2026 02:402,33514,953,1284,607,0001,232,0002,117,632
9Jun 9, 2026 02:402,36414,991,1004,645,0001,266,0002,117,632