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 20, 2026 11:02Jacob McDanielJacob McDanielScore: 2,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 11:032,70817,195,5605,561,0001,210,0002,121,728
2May 20, 2026 11:032,71016,120,2545,554,0001,223,0002,121,728
3May 20, 2026 11:032,71116,463,0995,565,0001,213,0002,121,728
4May 20, 2026 11:032,72217,107,9565,590,0001,215,0002,121,728
5May 20, 2026 11:032,83417,254,1035,804,0001,282,0002,121,728
6May 20, 2026 11:032,86818,289,0115,880,0001,292,0002,121,728
7May 20, 2026 11:032,87619,189,5095,912,0001,279,0002,121,728
8May 20, 2026 11:032,91019,127,7485,986,0001,290,0002,121,728
9May 20, 2026 11:032,92820,606,0955,978,0001,344,0002,121,728