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 3, 2026 20:33Elijah KinElijah KinScore: 3,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 20:362,90616,333,5636,158,0001,109,0002,117,632
2Jun 3, 2026 20:362,93016,384,5116,182,0001,144,0002,117,632
3Jun 3, 2026 20:362,98216,997,1136,324,0001,131,0002,117,632
4Jun 3, 2026 20:363,00817,888,1796,361,0001,159,0002,117,632
5Jun 3, 2026 20:363,02416,619,9466,381,0001,180,0002,117,632
6Jun 3, 2026 20:363,05417,112,6526,483,0001,152,0002,117,632
7Jun 3, 2026 20:363,05617,094,9886,466,0001,176,0002,117,632
8Jun 3, 2026 20:363,05617,142,2556,483,0001,157,0002,117,632
9Jun 3, 2026 20:363,08217,204,3346,543,0001,162,0002,117,632