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 17, 2026 03:23M-RochatM-RochatScore: 19,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:2418,531620,453,474608,185,0003,349,0002,113,536
2May 17, 2026 03:2418,835630,500,792618,378,0003,203,0002,113,536
3May 17, 2026 03:2418,859631,117,158619,192,0003,185,0002,113,536
4May 17, 2026 03:2418,886633,628,225619,996,0003,259,0002,113,536
5May 17, 2026 03:2419,173643,017,482629,718,0003,009,0002,113,536
6May 17, 2026 03:2419,191642,274,572630,063,0003,241,0002,113,536
7May 17, 2026 03:2419,649658,650,119645,410,0003,010,0002,113,536
8May 17, 2026 03:2419,912667,072,897654,117,0003,010,0002,113,536
9May 17, 2026 03:2420,120674,476,419659,942,0004,037,0002,113,536