Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 8, 2026 02:25highloadLLMhighloadLLMScore: 15,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:2615,126508,597,228386,554,000112,628,0002,113,536
2Jun 8, 2026 02:2615,131508,545,761385,856,000113,478,0002,113,536
3Jun 8, 2026 02:2615,171509,823,259387,112,000113,535,0002,113,536
4Jun 8, 2026 02:2615,184510,256,056387,999,000113,104,0002,113,536
5Jun 8, 2026 02:2615,201511,310,067386,546,000115,093,0002,113,536
6Jun 8, 2026 02:2615,251512,459,373388,157,000115,153,0002,113,536
7Jun 8, 2026 02:2615,263512,842,154386,059,000117,620,0002,113,536
8Jun 8, 2026 02:2615,274513,148,160387,216,000116,857,0002,113,536
9Jun 8, 2026 02:2615,290513,871,983386,736,000117,864,0002,113,536