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 23:07Josu San MartinJosu San MartinScore: 4,301Success
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:084,289151,628,932140,561,0001,007,0002,113,536
2May 14, 2026 23:084,291150,983,788140,612,0001,008,0002,113,536
3May 14, 2026 23:084,295153,907,486140,740,0001,009,0002,113,536
4May 14, 2026 23:084,295150,637,536140,742,0001,009,0002,113,536
5May 14, 2026 23:084,301150,864,984140,958,0001,007,0002,113,536
6May 14, 2026 23:084,307152,632,819141,154,0001,008,0002,113,536
7May 14, 2026 23:084,310152,951,704141,239,0001,008,0002,113,536
8May 14, 2026 23:084,317152,282,624141,480,0001,008,0002,113,536
9May 14, 2026 23:084,319153,131,393141,534,0001,006,0002,113,536