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 30, 2026 02:53Elijah KinElijah KinScore: 9,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 02:559,34035,411,15520,249,0003,103,0002,113,536
2May 30, 2026 02:559,34934,317,89120,284,0003,089,0002,113,536
3May 30, 2026 02:559,36835,958,73020,334,0003,088,0002,113,536
4May 30, 2026 02:559,39632,632,95820,385,0003,107,0002,113,536
5May 30, 2026 02:559,41732,693,26220,313,0003,231,0002,113,536
6May 30, 2026 02:559,45732,692,53720,552,0003,092,0002,113,536
7May 30, 2026 02:559,49233,994,94120,512,0003,220,0002,113,536
8May 30, 2026 02:559,64036,118,86421,018,0003,083,0002,113,536
9May 30, 2026 02:559,68833,961,63721,001,0003,219,0002,113,536