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 7, 2026 01:37Elijah KinElijah KinScore: 2,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 01:392,25814,643,8424,535,0001,110,0002,117,632
2Jun 7, 2026 01:392,26314,662,3324,542,0001,116,0002,117,632
3Jun 7, 2026 01:392,28614,753,4924,598,0001,117,0002,117,632
4Jun 7, 2026 01:392,28914,780,0014,605,0001,119,0002,117,632
5Jun 7, 2026 01:392,42515,173,3484,951,0001,113,0002,117,632
6Jun 7, 2026 01:392,43615,127,8644,981,0001,111,0002,117,632
7Jun 7, 2026 01:392,51315,822,4435,173,0001,110,0002,117,632
8Jun 7, 2026 01:392,53816,131,9605,235,0001,112,0002,117,632
9Jun 7, 2026 01:392,54415,390,5605,247,0001,114,0002,117,632