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 28, 2026 08:26TudyMTudyMScore: 37,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:2837,798110,697,60192,487,0002,010,0002,449,408
2Apr 28, 2026 08:2837,800114,695,38090,479,0004,021,0002,453,504
3Apr 28, 2026 08:2837,807113,272,93690,540,0003,979,0002,453,504
4Apr 28, 2026 08:2837,818110,971,53390,524,0004,023,0002,445,312
5Apr 28, 2026 08:2837,826116,318,66692,555,0002,012,0002,457,600
6Apr 28, 2026 08:2837,840107,149,79091,583,0003,019,0002,387,968
7Apr 28, 2026 08:2837,854113,808,97792,624,0002,013,0002,469,888
8Apr 28, 2026 08:2837,879109,673,53591,676,0003,022,0002,465,792
9Apr 28, 2026 08:2837,885110,549,50091,692,0003,022,0002,449,408