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:21TudyMTudyMScore: 88,800Success
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:2388,719237,351,307219,800,0001,998,0002,449,408
2Apr 28, 2026 08:2388,752233,525,747217,885,0003,997,0002,400,256
3Apr 28, 2026 08:2388,783241,545,688218,959,0002,999,0002,514,944
4Apr 28, 2026 08:2388,786239,598,421218,954,0003,013,0002,465,792
5Apr 28, 2026 08:2388,800236,273,386218,001,0004,000,0002,453,504
6Apr 28, 2026 08:2388,814238,563,978219,037,0003,000,0002,465,792
7Apr 28, 2026 08:2388,824241,860,820219,062,0003,000,0002,412,544
8Apr 28, 2026 08:2388,853243,461,829219,132,0003,001,0002,457,600
9Apr 28, 2026 08:2388,864237,709,024220,161,0002,001,0002,469,888