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 16, 2026 08:30M-RochatM-RochatScore: 28,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:3228,871963,280,529940,005,00012,755,0002,113,536
2May 16, 2026 08:3228,913965,567,793941,699,00012,444,0002,113,536
3May 16, 2026 08:3228,955966,186,959942,901,00012,627,0002,113,536
4May 16, 2026 08:3228,955967,908,931941,106,00014,427,0002,113,536
5May 16, 2026 08:3228,994965,774,874943,920,00012,894,0002,113,536
6May 16, 2026 08:3229,195972,097,410950,885,00012,579,0002,113,536
7May 16, 2026 08:3229,235973,606,119951,849,00012,913,0002,113,536
8May 16, 2026 08:3229,448982,471,924958,850,00012,940,0002,113,536
9May 16, 2026 08:3229,979998,724,475976,462,00012,848,0002,113,536