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 listDec 22, 2025 02:24Josu San MartinJosu San MartinScore: 57,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 02:2456,2891,888,580,8871,818,537,00038,990,0002,408,448
2Dec 22, 2025 02:2456,4671,892,066,3511,822,416,00040,986,0002,387,968
3Dec 22, 2025 02:2456,4841,895,191,7161,824,007,00039,978,0002,285,568
4Dec 22, 2025 02:2457,0271,909,776,1561,832,916,00048,971,0002,289,664
5Dec 22, 2025 02:2457,2101,918,248,5321,848,957,00038,978,0002,523,136
6Dec 22, 2025 02:2457,2331,919,658,1491,851,706,00036,974,0002,359,296
7Dec 22, 2025 02:2457,2551,917,592,8851,849,426,00039,987,0002,326,528
8Dec 22, 2025 02:2457,5591,926,247,6821,862,463,00036,969,0002,285,568
9Dec 22, 2025 02:2457,5981,927,496,6681,857,747,00042,971,0002,285,568