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 24, 2026 08:40Dominique GarmierDominique GarmierScore: 8,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:408,49437,397,56715,168,0006,067,0002,535,424
2Apr 24, 2026 08:408,49838,722,40218,212,0003,035,0002,527,232
3Apr 24, 2026 08:408,52139,822,48418,261,0003,043,0002,535,424
4Apr 24, 2026 08:408,58142,781,34917,368,0004,086,0002,531,328
5Apr 24, 2026 08:408,59339,726,77016,368,0005,115,0002,523,136
6Apr 24, 2026 08:408,59640,834,35916,375,0005,117,0002,527,232
7Apr 24, 2026 08:408,61544,213,35716,410,0005,128,0002,535,424
8Apr 24, 2026 08:408,79843,199,74416,998,0004,999,0002,531,328
9Apr 24, 2026 08:409,06436,609,56416,480,0006,180,0002,523,136