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 listApr 30, 2026 23:38olliecrowolliecrowScore: 3,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 23:403,70724,664,6046,179,0003,089,0002,392,064
2Apr 30, 2026 23:403,71730,118,7278,262,0001,032,0002,326,528
3Apr 30, 2026 23:403,73425,369,8256,225,0003,112,0002,400,256
4Apr 30, 2026 23:403,73729,549,7817,267,0002,076,0002,400,256
5Apr 30, 2026 23:403,75426,171,9626,257,0003,128,0002,387,968
6Apr 30, 2026 23:403,91730,113,8277,618,0002,176,0002,396,160
7Apr 30, 2026 23:403,99235,664,9176,987,0002,994,0002,400,256
8Apr 30, 2026 23:403,99227,940,6275,989,0003,993,0002,387,968
9Apr 30, 2026 23:403,99425,451,1707,989,0001,997,0002,351,104