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 listApr 22, 2026 11:45Dominique GarmierDominique GarmierScore: 8,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:468,50938,456,86817,221,0004,052,0002,531,328
2Apr 22, 2026 11:468,51842,028,65119,268,0002,028,0002,531,328
3Apr 22, 2026 11:468,53338,459,74717,270,0004,063,0002,531,328
4Apr 22, 2026 11:468,54038,062,22114,234,0007,117,0002,334,720
5Apr 22, 2026 11:468,57737,126,17918,381,0003,063,0002,523,136
6Apr 22, 2026 11:468,59437,390,59917,394,0004,092,0002,527,232
7Apr 22, 2026 11:468,69646,780,90116,565,0005,176,0002,539,520
8Apr 22, 2026 11:468,82241,775,50216,041,0006,015,0002,519,040
9Apr 22, 2026 11:469,14338,989,32817,889,0004,969,0002,338,816