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 13, 2026 17:36Josu San MartinJosu San MartinScore: 3,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:373,426123,914,366112,009,0001,052,0002,113,536
2May 13, 2026 17:373,431122,019,276112,190,0001,065,0002,113,536
3May 13, 2026 17:373,449124,518,334112,793,0001,054,0002,113,536
4May 13, 2026 17:373,457124,706,714113,056,0001,036,0002,113,536
5May 13, 2026 17:373,458125,785,149113,099,0001,037,0002,113,536
6May 13, 2026 17:373,458122,837,031113,103,0001,033,0002,113,536
7May 13, 2026 17:373,460124,428,064113,164,0001,043,0002,113,536
8May 13, 2026 17:373,462125,196,016113,221,0001,048,0002,113,536
9May 13, 2026 17:373,466125,535,861113,354,0001,053,0002,113,536