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 listMay 14, 2025 08:36Emanuele BolognesiEmanuele BolognesiScore: 99,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2025 08:3699,0733,296,908,2203,265,406,0003,998,0002,441,216
2May 14, 2025 08:3699,2393,301,721,6503,268,904,0005,996,0002,420,736
3May 14, 2025 08:3699,4193,306,697,4893,272,838,0007,994,0002,277,376