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 listNov 12, 2025 15:46Aliaksandr MikheiAliaksandr MikheiScore: 140,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 15:46138,7134,609,355,6684,377,686,000199,848,0002,293,760
2Nov 12, 2025 15:46140,0544,648,379,0924,417,953,000203,813,0002,269,184
3Nov 12, 2025 15:46141,1264,689,996,1454,450,318,000206,828,0002,400,256