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:36M-RochatM-RochatScore: 28,104Success
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:4227,666921,893,940906,093,0006,909,0002,113,536
2May 16, 2026 08:4227,877929,265,020912,882,0007,059,0002,113,536
3May 16, 2026 08:4227,923933,359,538914,515,0006,960,0002,113,536
4May 16, 2026 08:4227,938931,280,486914,818,0007,167,0002,113,536
5May 16, 2026 08:4228,104939,136,175920,254,0007,200,0002,113,536
6May 16, 2026 08:4228,209941,365,537923,840,0007,073,0002,113,536
7May 16, 2026 08:4229,263976,572,490958,744,0006,956,0002,113,536
8May 16, 2026 08:4229,346980,271,898960,685,0007,739,0002,113,536
9May 16, 2026 08:4229,416981,921,858963,299,0007,445,0002,113,536