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 13, 2026 18:54Josu San MartinJosu San MartinScore: 3,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:553,360119,663,113109,861,0001,032,0002,113,536
2May 13, 2026 18:553,365120,932,625110,011,0001,053,0002,113,536
3May 13, 2026 18:553,366120,147,872110,050,0001,049,0002,113,536
4May 13, 2026 18:553,368122,810,501110,098,0001,057,0002,113,536
5May 13, 2026 18:553,369120,005,131110,145,0001,050,0002,113,536
6May 13, 2026 18:553,380123,573,281110,507,0001,038,0002,113,536
7May 13, 2026 18:553,395120,820,684111,009,0001,041,0002,113,536
8May 13, 2026 18:553,398122,479,838111,110,0001,046,0002,113,536
9May 13, 2026 18:553,407122,096,166111,409,0001,044,0002,113,536