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 listOct 9, 2026 12:03janwwwjanwwwScore: 1,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 12:091,56412,808,0822,827,0001,084,0002,117,632
2Oct 9, 2026 12:091,57712,827,3172,849,0001,095,0002,117,632
3Oct 9, 2026 12:091,62113,323,6142,925,0001,129,0002,117,632
4Oct 9, 2026 12:091,66212,959,5293,025,0001,130,0002,117,632
5Oct 9, 2026 12:091,66413,077,1632,945,0001,216,0002,117,632
6Oct 9, 2026 12:091,67913,076,5232,973,0001,226,0002,117,632
7Oct 9, 2026 12:091,68213,006,9703,006,0001,200,0002,117,632
8Oct 9, 2026 12:091,69020,740,1602,966,0001,259,0002,117,632
9Oct 9, 2026 12:091,71213,062,4323,066,0001,214,0002,117,632