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, 2026 22:59Josu San MartinJosu San MartinScore: 4,378Success
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, 2026 23:004,364153,279,798143,025,0001,008,0002,113,536
2May 14, 2026 23:004,365154,739,847143,043,0001,010,0002,113,536
3May 14, 2026 23:004,368154,322,827143,146,0001,009,0002,113,536
4May 14, 2026 23:004,373153,063,111143,303,0001,007,0002,113,536
5May 14, 2026 23:004,378155,073,618143,490,0001,010,0002,113,536
6May 14, 2026 23:004,380155,232,877143,553,0001,006,0002,113,536
7May 14, 2026 23:004,386154,409,518143,754,0001,006,0002,113,536
8May 14, 2026 23:004,387156,035,950143,770,0001,008,0002,113,536
9May 14, 2026 23:004,388153,608,934143,826,0001,008,0002,113,536