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 listSep 14, 2026 11:14Victor MerckléVictor MerckléScore: 1,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 11:151,43312,217,6282,501,0001,082,0002,117,632stderr
2Sep 14, 2026 11:151,43612,297,3882,501,0001,091,0002,117,632stderr
3Sep 14, 2026 11:151,43612,373,2472,504,0001,088,0002,117,632stderr
4Sep 14, 2026 11:151,43612,173,5882,499,0001,092,0002,117,632stderr
5Sep 14, 2026 11:151,44412,493,7052,517,0001,093,0002,117,632stderr
6Sep 14, 2026 11:151,51012,596,0552,646,0001,131,0002,117,632stderr
7Sep 14, 2026 11:151,51212,415,1722,641,0001,141,0002,117,632stderr
8Sep 14, 2026 11:151,52612,398,5442,659,0001,158,0002,117,632stderr
9Sep 14, 2026 11:151,52812,519,3482,677,0001,143,0002,117,632stderr