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 7, 2026 03:49Elijah KinElijah KinScore: 2,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 03:512,25714,689,2314,532,0001,111,0002,117,632
2Jun 7, 2026 03:512,26214,778,3914,543,0001,113,0002,117,632
3Jun 7, 2026 03:512,39015,078,9754,869,0001,106,0002,117,632
4Jun 7, 2026 03:512,39315,019,3134,870,0001,113,0002,117,632
5Jun 7, 2026 03:512,43817,043,9674,981,0001,114,0002,117,632
6Jun 7, 2026 03:512,44916,782,8595,013,0001,110,0002,117,632
7Jun 7, 2026 03:512,47415,191,3345,075,0001,112,0002,117,632
8Jun 7, 2026 03:512,47615,207,7635,083,0001,107,0002,117,632
9Jun 7, 2026 03:512,56015,438,0895,283,0001,117,0002,117,632