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 00:00Elijah KinElijah KinScore: 2,416Success
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 00:022,25114,658,6034,520,0001,108,0002,117,632
2Jun 7, 2026 00:022,25814,652,1834,543,0001,104,0002,117,632
3Jun 7, 2026 00:022,26214,672,3524,551,0001,105,0002,117,632
4Jun 7, 2026 00:022,30114,821,1204,638,0001,116,0002,117,632
5Jun 7, 2026 00:022,41615,037,2004,939,0001,102,0002,117,632
6Jun 7, 2026 00:022,42015,042,2634,938,0001,112,0002,117,632
7Jun 7, 2026 00:022,45015,200,0264,972,0001,153,0002,117,632
8Jun 7, 2026 00:022,54117,851,5785,170,0001,183,0002,117,632
9Jun 7, 2026 00:022,54915,466,6145,273,0001,100,0002,117,632