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 18, 2026 01:53M-RochatM-RochatScore: 18,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:5418,583622,724,233609,186,0004,084,0002,113,536
2May 18, 2026 01:5418,608625,317,721611,079,0003,006,0002,113,536
3May 18, 2026 01:5418,620626,203,613611,471,0003,008,0002,113,536
4May 18, 2026 01:5418,634626,308,439610,902,0004,033,0002,113,536
5May 18, 2026 01:5418,780631,348,529615,760,0004,004,0002,113,536
6May 18, 2026 01:5418,817633,105,426617,973,0003,011,0002,113,536
7May 18, 2026 01:5418,901633,369,412619,751,0004,010,0002,113,536
8May 18, 2026 01:5419,840664,487,906650,724,0004,003,0002,113,536
9May 18, 2026 01:5419,989670,061,738655,464,0004,187,0002,113,536