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 1, 2026 04:14Charles CabergsCharles CabergsScore: 4,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 04:154,89928,614,8747,145,0005,103,0002,465,792
2May 1, 2026 04:154,90831,438,4258,181,0004,090,0002,457,600
3May 1, 2026 04:154,90931,842,9497,159,0005,114,0002,461,696
4May 1, 2026 04:154,91132,983,1967,162,0005,116,0002,457,600
5May 1, 2026 04:154,91432,074,0597,167,0005,119,0002,449,408
6May 1, 2026 04:154,91625,897,39110,243,0002,048,0002,453,504
7May 1, 2026 04:154,97030,610,3156,213,0006,213,0002,461,696
8May 1, 2026 04:155,09628,784,2419,555,0003,185,0002,449,408
9May 1, 2026 04:155,09829,354,94810,621,0002,124,0002,457,600