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 00:23Elijah KinElijah KinScore: 2,178Success
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 00:242,02014,105,0733,826,0001,224,0002,117,632
2Jun 9, 2026 00:242,02114,221,7373,830,0001,224,0002,117,632
3Jun 9, 2026 00:242,02214,173,4123,829,0001,226,0002,117,632
4Jun 9, 2026 00:242,02714,196,7423,827,0001,242,0002,117,632
5Jun 9, 2026 00:242,17814,550,4474,200,0001,247,0002,117,632
6Jun 9, 2026 00:242,18514,535,2054,213,0001,250,0002,117,632
7Jun 9, 2026 00:242,28514,726,5094,462,0001,251,0002,117,632
8Jun 9, 2026 00:242,30914,805,2174,522,0001,252,0002,117,632
9Jun 9, 2026 00:242,37714,977,0204,814,0001,129,0002,117,632