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 18, 2026 01:48M-RochatM-RochatScore: 18,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:5118,127608,370,806594,830,0003,378,0002,113,536
2May 18, 2026 01:5118,133609,637,011594,333,0004,072,0002,113,536
3May 18, 2026 01:5118,320616,569,665600,540,0004,037,0002,113,536
4May 18, 2026 01:5118,473619,084,415605,567,0004,062,0002,113,536
5May 18, 2026 01:5118,753628,320,524615,854,0003,008,0002,113,536
6May 18, 2026 01:5118,818630,441,755616,984,0004,010,0002,113,536
7May 18, 2026 01:5118,957635,032,385621,542,0004,065,0002,113,536
8May 18, 2026 01:5119,549655,278,212641,120,0004,007,0002,113,536
9May 18, 2026 01:5119,681658,958,166645,462,0004,014,0002,113,536