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 20, 2026 20:45Charles CabergsCharles CabergsScore: 12,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 20:4612,26558,606,30720,443,00010,221,0002,433,024
2Apr 20, 2026 20:4612,27154,568,34222,497,0008,181,0002,437,120
3Apr 20, 2026 20:4612,27457,565,25919,434,00011,251,0002,437,120
4Apr 20, 2026 20:4612,33257,563,41315,913,00014,918,0002,437,120
5Apr 20, 2026 20:4612,35457,490,07517,934,00012,952,0002,437,120
6Apr 20, 2026 20:4612,37160,536,20718,957,00011,972,0002,433,024
7Apr 20, 2026 20:4612,39059,697,49119,984,00010,991,0002,441,216
8Apr 20, 2026 20:4612,49055,491,86319,139,00012,088,0002,498,560
9Apr 20, 2026 20:4612,54955,554,47622,265,0009,108,0002,437,120