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:49Josu San MartinJosu San MartinScore: 4,179Success
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:514,175149,496,304135,775,0002,006,0002,113,536
2May 14, 2026 23:514,177147,549,251135,842,0002,016,0002,113,536
3May 14, 2026 23:514,177149,582,609135,821,0002,027,0002,113,536
4May 14, 2026 23:514,179149,583,267135,906,0002,032,0002,113,536
5May 14, 2026 23:514,179148,417,478135,878,0002,059,0002,113,536
6May 14, 2026 23:514,181147,464,068136,983,0001,012,0002,113,536
7May 14, 2026 23:514,182149,614,087135,992,0002,043,0002,113,536
8May 14, 2026 23:514,187147,706,746136,133,0002,048,0002,113,536
9May 14, 2026 23:514,189148,654,963137,247,0001,013,0002,113,536