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 listJun 11, 2026 00:17Victor MerckléVictor MerckléScore: 3,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 00:182,92815,937,1814,939,0002,382,0002,142,208
2Jun 11, 2026 00:183,01515,081,4914,911,0002,627,0002,142,208
3Jun 11, 2026 00:183,01917,603,0775,015,0002,533,0002,142,208
4Jun 11, 2026 00:183,04816,675,5785,020,0002,600,0002,142,208
5Jun 11, 2026 00:183,05616,950,6515,167,0002,475,0002,142,208
6Jun 11, 2026 00:183,07816,555,4845,344,0002,351,0002,142,208
7Jun 11, 2026 00:183,11315,324,8955,303,0002,480,0002,142,208
8Jun 11, 2026 00:183,12216,948,7455,441,0002,364,0002,142,208
9Jun 11, 2026 00:183,13718,837,7875,156,0002,688,0002,138,112