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 09:12Josu San MartinJosu San MartinScore: 3,553Success
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 09:133,520126,905,291115,159,0001,005,0002,113,536
2May 13, 2026 09:133,527127,225,681115,150,0001,262,0002,113,536
3May 13, 2026 09:133,528127,312,464115,173,0001,257,0002,113,536
4May 13, 2026 09:133,550127,570,412115,920,0001,241,0002,113,536
5May 13, 2026 09:133,553126,039,095116,035,0001,244,0002,113,536
6May 13, 2026 09:133,556126,339,375116,340,0001,008,0002,113,536
7May 13, 2026 09:133,557129,083,497116,138,0001,247,0002,113,536
8May 13, 2026 09:133,559129,401,111116,195,0001,258,0002,113,536
9May 13, 2026 09:133,562128,109,427116,323,0001,247,0002,113,536