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 listMay 29, 2026 16:36Victor MerckléVictor MerckléScore: 2,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 16:372,55615,646,8965,076,0001,315,0002,113,536
2May 29, 2026 16:372,55715,582,5495,077,0001,316,0002,113,536
3May 29, 2026 16:372,55915,281,8915,087,0001,312,0002,113,536
4May 29, 2026 16:372,56414,202,4815,096,0001,316,0002,113,536
5May 29, 2026 16:372,59314,441,9815,152,0001,331,0002,113,536
6May 29, 2026 16:372,62914,770,7875,222,0001,351,0002,113,536
7May 29, 2026 16:372,64217,506,4685,250,0001,355,0002,113,536
8May 29, 2026 16:372,64815,813,5495,311,0001,311,0002,113,536
9May 29, 2026 16:372,68814,913,1355,414,0001,308,0002,113,536